diff -r 01f8c7aabb7e -r 06c2228e39cb thirdparty/python-graph/docs/graph.minmax-module.html --- /dev/null Thu Jan 01 00:00:00 1970 +0000 +++ b/thirdparty/python-graph/docs/graph.minmax-module.html Wed Nov 26 23:56:19 2008 +0000 @@ -0,0 +1,237 @@ + + + + + graph.minmax + + + + + + + + + + + + + + + + + + + + + + + + + + + + + +

+ + Package graph :: + Module minmax + +

+ + +

+ +

Module minmax

Minimization and maximization algorithms for python-graph.

+ + + + + + + + + + + + + +

+ Functions

+ dictionary +

+ + + + + +

minimal_spanning_tree(graph, + root=None)
+ Minimal spanning tree.

+ + +

+ +

+ tuple +

+ + + + + +

shortest_path(graph, + source)
+ Return the shortest path distance between source and all other nodes + using Dijkstra's algorithm.

+ + +

+ +

+ + + + + + +

+ Function Details

+ +

+ + +

minimal_spanning_tree(graph, + root=None) +

+ +

Minimal spanning tree.

Parameters:

graph (graph) - Graph.
root (node) - Optional root node (will explore only root's connected component)

Returns: dictionary

Generated spanning tree.

Attention: + Minimal spanning tree meaningful only for weighted graphs. +

+ +

+ + +

shortest_path(graph, + source) +

+ +

Return the shortest path distance between source and all other nodes + using Dijkstra's algorithm.

Parameters:

graph (graph) - Graph.
source (node) - Node from which to start the search.

Returns: tuple

A tuple containing two dictionaries, each keyed by target nodes. +

+ Shortest path spanning tree +
+ Shortest distance from given source to each target node +

Inaccessible target nodes do not appear in either + dictionary.

Attention: + All weights must be nonnegative. +

+
+ + + + + + + + + + + + + + + + + + + + + + + + +

+ + + +