_build_paths_from_predecessors(sources, target, pred)
There may be many paths between the sources and target. If there are cycles among the predecessors, this function will not produce all possible paths because doing so would produce infinitely many paths of unbounded length -- instead, we only produce simple paths.
Starting nodes for path.
Ending node for path.
A dictionary of predecessor lists, keyed by node
If :None:None:`target` cannot be reached from :None:None:`source`.
A generator of all paths between source and target.
Compute all simple paths to target, given the predecessors found in pred, terminating when any source in sources is found.
Hover to see nodes names; edges to Self not shown, Caped at 50 nodes.
Using a canvas is more power efficient and can get hundred of nodes ; but does not allow hyperlinks; , arrows or text (beyond on hover)
SVG is more flexible but power hungry; and does not scale well to 50 + nodes.
All aboves nodes referred to, (or are referred from) current nodes; Edges from Self to other have been omitted (or all nodes would be connected to the central node "self" which is not useful). Nodes are colored by the library they belong to, and scaled with the number of references pointing them