Back
bf-path-bi (clj)
(source)function
(bf-path-bi outgoing predecessors start end)
Using a bidirectional breadth-first search, finds a path from start
to end with the fewest hops (i.e. irrespective of edge weights),
outgoing and predecessors being functions which return adjacent
nodes. Can be much faster than a unidirectional search on certain
types of graphs