libconfix.core.digraph.algorithm

Package libconfix :: Package core :: Package digraph :: Module algorithm

[show private | hide private]

Module libconfix.core.digraph.algorithm

Function Summary
	`combine_graphs(digraphs)` Combine nodes and edges of all graphs in digraphs and return the resulting graph.
	`nearest_property(digraph, entrypoint, property)`
	`nodes_reached_from_excluding_entry(digraph, entrypoints)` From digraph, select all nodes that can be reached from one of the entrypoints, excluding the entrypoints.
	`nodes_reached_from_including_entry(digraph, entrypoints)` From digraph, select all nodes that can be reached from one of the entrypoints, including the entrypoints.
	`reached_from(digraph, entrypoints)`
	`select_containing_edges(nodes, edges)` From edges, select those whose ends are members of nodes (and return them).
	`subgraph(digraph, nodes)` From digraph, select nodes and remaining edges to form a new digraph.
	`subtract_nodes(digraph, nodes)` Subtract nodes from digraph, together with the affected edges.

Function Details

Combine nodes and edges of all graphs in digraphs and return
the resulting graph.

From digraph, select all nodes that can be reached from one of
the entrypoints, excluding the entrypoints. return type is a set.

From digraph, select all nodes that can be reached from one of
the entrypoints, including the entrypoints. Return type is a set.

From edges, select those whose ends are members of nodes (and
return them).

From digraph, select nodes and remaining edges to form a new
digraph. Return the new digraph.

Subtract nodes from digraph, together with the affected
edges. Return resulting digraph.

Generated by Epydoc 2.1 on Fri Nov 23 16:56:36 2007