Package pygraph :: Package algorithms :: Module accessibility

Module accessibility

Accessibility algorithms.

Functions

dictionary

accessibility(graph)
Accessibility matrix (transitive closure).

dictionary

connected_components(graph)
Connected components.

list

cut_edges(graph)
Return the cut-edges of the given graph.

list

cut_nodes(graph)
Return the cut-nodes of the given graph.

dictionary

mutual_accessibility(graph)
Mutual-accessibility matrix (strongly connected components).

Variables
	__package__ = `'pygraph.algorithms'`

Function Details

Accessibility matrix (transitive closure).

Parameters:

Returns: dictionary

Accessibility information for each node.

Connected components.

Parameters:

Returns: dictionary

Pairing that associates each node to its connected component.

Return the cut-edges of the given graph.

A cut edge, or bridge, is an edge of a graph whose removal increases the number of connected components in the graph.

Parameters:

Returns: list

List of cut-edges.

Return the cut-nodes of the given graph.

A cut node, or articulation point, is a node of a graph whose removal increases the number of connected components in the graph.

Parameters:

Returns: list

List of cut-nodes.

Mutual-accessibility matrix (strongly connected components).

Parameters:

Returns: dictionary

Mutual-accessibility information for each node.