_bidirectional_shortest_path(G, source, target, exclude)
This function and its helper are originally from networkx.algorithms.shortest_paths.unweighted and are modified to accept the extra parameter 'exclude', which is a container for nodes already used in other paths that should be ignored.
Starting node for path
Ending node for path
Container for nodes to exclude from the search for shortest paths
If there is no path or if nodes are adjacent and have only one path between them
Shortest path between source and target ignoring nodes in 'exclude'
Returns shortest path between source and target ignoring nodes in the container 'exclude'.
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