bf-paths-bi (clj)

function

(bf-paths-bi successors predecessors start end)

Using a bidirectional breadth-first search, returns all shortest paths from start to end; predecessors is called on end and each preceding node, successors is called on start, etc.

Public Vars

bf-paths-bi (clj)

function

Examples