Javalobby - Comments for "Algorithm of the Week: Graph Breadth First Search"
http://java.dzone.com/articles/algorithm-week-graph-breadth
Comments for "Algorithm of the Week: Graph Breadth First Search"ensee
http://java.dzone.com/articles/algorithm-week-graph-breadth#comment-105057
<!--paging_filter--><p>see https://github.com/graphhopper/graphhopper/blob/master/core/src/main/java/com/graphhopper/util/XFirstSearch.java</p>Sat, 28 Sep 2013 13:30:45 -0400peathalcomment 105057 at http://java.dzone.comHi! Can you please help me?
http://java.dzone.com/articles/algorithm-week-graph-breadth#comment-105053
<!--paging_filter--><p>Hi! Can you please help me? Do you still have the java program for BFS friend search?</p><p><br /></p>Sat, 28 Sep 2013 09:48:44 -0400GorionXcomment 105053 at http://java.dzone.comShouldn't vertices 1 and 4 in
http://java.dzone.com/articles/algorithm-week-graph-breadth#comment-87389
<!--paging_filter-->Shouldn't vertices 1 and 4 in step #4 and #5 be in one step? Both are at depth 2 counting from the starting vertex 2.Wed, 12 Sep 2012 02:39:13 -0400wscomment 87389 at http://java.dzone.comHere is BFS (and DFS) for
http://java.dzone.com/articles/algorithm-week-graph-breadth#comment-87375
<!--paging_filter--><p>Here is <a href="https://github.com/karussell/GraphHopper/blob/master/core/src/main/java/de/jetsli/graph/util/XFirstSearch.java">BFS</a> (and DFS) for Java - works memory efficient, is customizable and tested! Now I would like to know a speed comparison ;)</p><p> </p><p>BTW1: What kind of complexity you are refering - time or space? Because time compl. is O(|E| + |V|) and space compl. is O(|V|)</p><p>BTW2: Nice algorithm posts :)</p>Tue, 11 Sep 2012 17:48:49 -0400peathalcomment 87375 at http://java.dzone.com