diff -r 01f8c7aabb7e -r 06c2228e39cb thirdparty/python-graph/docs/graph.accessibility-module.html --- /dev/null Thu Jan 01 00:00:00 1970 +0000 +++ b/thirdparty/python-graph/docs/graph.accessibility-module.html Wed Nov 26 23:56:19 2008 +0000 @@ -0,0 +1,335 @@ + + + + + graph.accessibility + + + + + + + + + + + + + + + + + + + + + + + +
   Home      Trees      Indices      Help    + + +
python-graph
+ + + + + +
+ + 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.
+
+
+
+
+ + + + + + + + + + + + + + + + + + +
   Home      Trees      Indices      Help    + + +
python-graph
+ + + + + +
+ Generated by Epydoc 3.0.1 on Mon Oct 27 20:36:37 2008 + + http://epydoc.sourceforge.net +
+ + + +