CrowLib icon indicating copy to clipboard operation
CrowLib copied to clipboard

Published 20 hours ago • verified publisher icon nanodeath

Implement BFS-as-shortest-path algorithm

Open nanodeath opened this issue 15 years ago • 3 comments

WIth fixed distances, BFS can be used to calculate a shortest path. It's faster than Dijkstra's, too.

nanodeath avatar Oct 03 '10 19:10 nanodeath

can you make some sample?

d2n avatar May 17 '13 06:05 d2n

unfortunately I haven't been able to implement this library. I was working in a prototype I din't get to the implementation of this algorithm. I was looking for other options like JAVA or the possibility of doing it with PHP. sorry

IsraelAcosta avatar May 18 '13 03:05 IsraelAcosta

It's not verified anywhere, so I'm not going to close this issue yet, but I think BFS is already implemented. bfs is the name of the traversal algorithm, which can be used to traverse the entire graph, or you can use bfs_basic which is a search algorithm and stops when it hits a goal. If you take a look at the test files (perfGraph.js for example) anywhere you see findGoal and the mention of an algorithm (like a*) you can instead use bfs or bfs_basic. Does that help?

nanodeath avatar May 18 '13 05:05 nanodeath