_dijkstra_multisource(G, sources, weight, pred=None, paths=None, cutoff=None, target=None)
The optional predecessor and path dictionaries can be accessed by the caller through the original pred and paths objects passed as arguments. No need to explicitly return pred or paths.
Starting nodes for paths. If this is just an iterable containing a single node, then all paths computed by this function will start from that node. If there are two or more nodes in this iterable, the computed paths may begin from any one of the start nodes.
Function with (u, v, data) input that returns that edges weight
dict to store a list of predecessors keyed by that node If None, predecessors are not stored.
dict to store the path list from source to each node, keyed by node. If None, paths are not stored.
Ending node for path. Search is halted when target is found.
Length (sum of edge weights) at which the search is stopped. If cutoff is provided, only return paths with summed weight <= cutoff.
If any of :None:None:`sources` is not in G.
A mapping from node to shortest distance to that node from one of the source nodes.
Uses Dijkstra's algorithm to find shortest weighted paths
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