single_source_dijkstra_path(G, source, cutoff=None, weight='weight')
Compute shortest path between source and all other reachable nodes for a weighted graph.
Edge weight attributes must be numerical. Distances are calculated as sums of weighted edges traversed.
The weight function can be used to hide edges by returning None. So weight = lambda u, v, d: 1 if d['color']=="red" else None
will find the shortest red path.
Starting node for path.
Length (sum of edge weights) at which the search is stopped. If cutoff is provided, only return paths with summed weight <= cutoff.
If this is a string, then edge weights will be accessed via the edge attribute with this key (that is, the weight of the edge joining u to :None:None:`v` will be G.edges[u, v][weight]
). If no such edge attribute exists, the weight of the edge is assumed to be one.
If this is a function, the weight of an edge is the value returned by the function. The function must accept exactly three positional arguments: the two endpoints of an edge and the dictionary of edge attributes for that edge. The function must return a number.
If :None:None:`source` is not in G.
Dictionary of shortest path lengths keyed by target.
Find shortest weighted paths in G from a source node.
>>> G = nx.path_graph(5)See :
... path = nx.single_source_dijkstra_path(G, 0)
... path[4] [0, 1, 2, 3, 4]
The following pages refer to to this document either explicitly or contain code examples using this.
networkx.algorithms.shortest_paths.weighted.single_source_dijkstra_path
networkx.algorithms.shortest_paths.weighted.single_source_dijkstra
networkx.algorithms.shortest_paths.generic.shortest_path
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