From 5f8de423f190bbb79a62f804151bc24824fa32d8 Mon Sep 17 00:00:00 2001 From: "Matt A. Tobin" Date: Fri, 2 Feb 2018 04:16:08 -0500 Subject: Add m-esr52 at 52.6.0 --- python/altgraph/doc/_build/html/graphutil.html | 162 +++++++++++++++++++++++++ 1 file changed, 162 insertions(+) create mode 100644 python/altgraph/doc/_build/html/graphutil.html (limited to 'python/altgraph/doc/_build/html/graphutil.html') diff --git a/python/altgraph/doc/_build/html/graphutil.html b/python/altgraph/doc/_build/html/graphutil.html new file mode 100644 index 000000000..774efcfdf --- /dev/null +++ b/python/altgraph/doc/_build/html/graphutil.html @@ -0,0 +1,162 @@ + + + + + + + + altgraph.GraphUtil — Utility functions — altgraph 0.11 documentation + + + + + + + + + + + + + +
+

Navigation

+ +
+ +
+
+
+
+ +
+

altgraph.GraphUtil — Utility functions

+

The module altgraph.GraphUtil performs a number of more +or less useful utility functions.

+
+
+altgraph.GraphUtil.generate_random_graph(node_num, edge_num[, self_loops[, multi_edges])
+

Generates and returns a Graph instance +with node_num nodes randomly connected by edge_num edges.

+

When self_loops is present and True there can be edges that point from +a node to itself.

+

When multi_edge is present and True there can be duplicate edges.

+

This method raises GraphError <altgraph.GraphError when +a graph with the requested configuration cannot be created.

+
+ +
+
+altgraph.GraphUtil.generate_scale_free_graph(steps, growth_num[, self_loops[, multi_edges]])
+

Generates and returns a Graph instance that +will have steps*growth_n um nodes and a scale free (powerlaw) +connectivity.

+

Starting with a fully connected graph with growth_num nodes +at every step growth_num nodes are added to the graph and are connected +to existing nodes with a probability proportional to the degree of these +existing nodes.

+
+

Warning

+

The current implementation is basically untested, although +code inspection seems to indicate an implementation that is consistent +with the description at +Wolfram MathWorld

+
+
+ +
+
+altgraph.GraphUtil.filter_stack(graph, head, filters)
+

Perform a depth-first oder walk of the graph starting at head and +apply all filter functions in filters on the node data of the nodes +found.

+

Returns (visited, removes, orphans), where

+
    +
  • visited: the set of visited nodes
    • +
  • removes: the list of nodes where the node data doesn’t match +all filters.
    • +
  • orphans: list of tuples (last_good, node), where +node is not in removes and one of the nodes that is connected +by an incoming edge is in removes. Last_good is the +closest upstream node that is not in removes.
    • +
+
+ +
+ + +
+
+
+
+
+

Previous topic

+

altgraph.GraphStat — Functions providing various graph statistics

+

Next topic

+

altgraph.Dot — Interface to the dot language

+ + +
+
+
+
+
+

Navigation

+ +
+
+ © Copyright 2010-2011, Ronald Oussoren, Bob Ippolito, 2004 Istvan Albert. + Created using Sphinx 1.2.1. +
+ + \ No newline at end of file -- cgit v1.2.3