qCDebug
git syncing a fork

infinite loop

涩兔子 posted @ 2015年10月26日 16:46 in 未分类 , 752 阅读

For example, A can have a neighbor called B. Therefore, we may traverse from A to B. An undirected graph implies that B can always traverse back to A. Is it true here? No, because whether B could traverse back to A depends if one of B’s neighbor is A.

The fact that B can traverse back to A implies that the graph may contain a cycle. You must take extra care to handle this case. Imagine that you finished implementing without considering this case, and later being pointed out by your interviewer that your code has an infinite loop, yuck!

  • 无匹配

登录 *


loading captcha image...
(输入验证码)
or Ctrl+Enter