Package graph :: Module accessibility |

# Module accessibility

Accessibility algorithms for python-graph.

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). |

Function Details

### accessibility(graph) |
Accessibility matrix (transitive closure). Parameters: `graph` (graph) - Graph. Returns: dictionary Accessibility information for each node.

### connected_components(graph) |
Connected components. Parameters: `graph` (graph) - Graph. Returns: dictionary Pairing that associates each node to its connected component. Attention: Indentification of connected components is meaningful only for non-directed graphs.

### cut_edges(graph) |
Return the cut-edges of the given graph. Returns: list List of cut-edges.

### cut_nodes(graph) |
Return the cut-nodes of the given graph. Returns: list List of cut-nodes.

### mutual_accessibility(graph) |
Mutual-accessibility matrix (strongly connected components). Parameters: `graph` (graph) - Graph. Returns: dictionary Mutual-accessibility information for each node.