From 5f8de423f190bbb79a62f804151bc24824fa32d8 Mon Sep 17 00:00:00 2001 From: "Matt A. Tobin" Date: Fri, 2 Feb 2018 04:16:08 -0500 Subject: Add m-esr52 at 52.6.0 --- python/altgraph/doc/_build/html/graphalgo.html | 134 +++++++++++++++++++++++++ 1 file changed, 134 insertions(+) create mode 100644 python/altgraph/doc/_build/html/graphalgo.html (limited to 'python/altgraph/doc/_build/html/graphalgo.html') diff --git a/python/altgraph/doc/_build/html/graphalgo.html b/python/altgraph/doc/_build/html/graphalgo.html new file mode 100644 index 000000000..07800d977 --- /dev/null +++ b/python/altgraph/doc/_build/html/graphalgo.html @@ -0,0 +1,134 @@ + + + + + + + + altgraph.GraphAlgo — Graph algorithms — altgraph 0.11 documentation + + + + + + + + + + + + + + + +
+
+
+
+ +
+

altgraph.GraphAlgo — Graph algorithms

+
+
+altgraph.GraphAlgo.dijkstra(graph, start[, end])
+

Dijkstra’s algorithm for shortest paths.

+

Find shortest paths from the start node to all nodes nearer +than or equal to the end node. The edge data is assumed to be the edge length.

+
+

Note

+

Dijkstra’s algorithm is only guaranteed to work correctly when all edge lengths are positive. +This code does not verify this property for all edges (only the edges examined until the end +vertex is reached), but will correctly compute shortest paths even for some graphs with negative +edges, and will raise an exception if it discovers that a negative edge has caused it to make a mistake.

+
+
+ +
+
+altgraph.GraphAlgo.shortest_path(graph, start, end)
+

Find a single shortest path from the given start node to the given end node. +The input has the same conventions as dijkstra(). The output is a list +of the nodes in order along the shortest path.

+
+ +
+ + +
+
+
+
+
+

Previous topic

+

altgraph.ObjectGraph — Graphs of objecs with an identifier

+

Next topic

+

altgraph.GraphStat — Functions providing various graph statistics

+ + +
+
+
+
+ + + + \ No newline at end of file -- cgit v1.2.3