[第二轮] 3/11-3/17 CareerCup 4.2

Given a directed graph, design an algorithm to find outwhether there is a route between two nodes.

发帖规范:http://www.1point3acres.com/bbs/thread-48094-1-1.html
http://www.1point3acres.com/bbs/thread-32423-1-1.html

dfs or bfs

https://github.com/moophis/careercup/blob/master/4.2.cpp

moophis 发表于 2013-3-12 23:14
https://github.com/moophis/careercup/blob/master/4.2.cpp

It seems that you haven't checked a node visited or not that may cause infinite loop. (in bfs)

zhuzhda 发表于 2013-3-14 14:26
It seems that you haven't checked a node visited or not that may cause infinite loop. (in bfs)

Thanks, have fixed that bug!

https://gist.github.com/ThunderXu/5175073
by mutiply adjacency matrixs

* method: 两种方法 DFS, BFS  大家可以参考一下我的实现方式，我把有向图无向图的BFS和DFS都实现了。。。。 图一直拖到现在，确实麻烦，前段时间一直在搞树。。一点一点努力吧

https://github.com/1094401996/Ca ... t2/IfConnected.java

https://gist.github.com/Jnight/5275734 拍砖有加分