Package pygraph :: Package algorithms :: Module minmax

Module minmax

Minimization and maximization algorithms.

Functions

list

heuristic_search(graph, start, goal, heuristic)
A* search algorithm.

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.

Variables
	__package__ = `'pygraph.algorithms'`

Function Details

A* search algorithm.

A set of heuristics is available under graph.heuristics. User-created heuristics are allowed too.

Parameters:

Returns: list

Optimized path from start to goal node

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 is meaningful only for weighted graphs.

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

Parameters:

Returns: tuple

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

Inaccessible target nodes do not appear in either dictionary.

Attention: All weights must be nonnegative.