b***k
发帖数: 2673 | 1 ☆─────────────────────────────────────☆
longtian (戒网中...) 于 (Fri May 23 13:40:36 2008) 提到:
There is a graph with n nodes and m edges. Given any two nodes, find out if
there is a path that connects them. How do you go about this problem?
Discuss ideas, trade-offs, algorithm ideas, and more。
☆─────────────────────────────────────☆
littleegg (爱吃茶叶蛋) 于 (Fri May 23 14:46:04 2008) 提到:
start from node m and n separately and keep tracing out the next node until
you find a common node, then t |
|
