We read every piece of feedback, and take your input very seriously.
To see all available qualifiers, see our documentation.
1 parent c5d5256 commit a4c5754Copy full SHA for a4c5754
graph/distance_map.py
@@ -7,6 +7,9 @@
7
8
def distance_map(graph, starts=None, ends=None, reverse=False):
9
"""Maps the shortest path distance from any start to any end.
10
+
11
+ The "many to many" version of single source shortest path.
12
13
:param graph: instance of Graph
14
:param starts: None, node or (set,list,tuple) of nodes
15
:param ends: None (exhaustive map), node or (set,list,tuple) of nodes
0 commit comments