_bidirectional_shortest_path(G, source, target, ignore_nodes=None, ignore_edges=None, weight=None)
This is a custom modification of the standard bidirectional shortest path implementation at networkx.algorithms.unweighted
starting node for path
ending node for path
nodes to ignore, optional
edges to ignore, optional
This function accepts a weight argument for convenience of shortest_simple_paths function. It will be ignored.
If no path exists between source and target.
List of nodes in a path from source to target.
Returns the shortest path between source and target ignoring
nodes and edges in the containers ignore_nodes and ignore_edges.
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