diff -r 342bebadd075 -r 88c486951f10 thirdparty/python-graph/docs/graph.accessibility-module.html
--- a/thirdparty/python-graph/docs/graph.accessibility-module.html Sun Nov 30 16:39:18 2008 +0000
+++ /dev/null Thu Jan 01 00:00:00 1970 +0000
@@ -1,335 +0,0 @@
-
-
-
-
- graph.accessibility
-
-
-
-
-
-
-
-
-
-Module accessibility
-Accessibility algorithms for python-graph.
-
-
-
-
-
-
-
- dictionary
- |
-
-
- accessibility(graph)
- Accessibility matrix (transitive closure). |
-
-
-
- |
-
-
-
- |
-
-
-
- dictionary
- |
-
-
- |
-
-
-
- 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). |
-
-
-
- |
-
-
-
- |
-
-
-
-
-
-
-
-
-
-
-
- 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.
-
- |
-
-
-
-
-
-
-
-
-