partition_spanning_tree(G, minimum=True, weight='weight', partition='partition', ignore_nan=False)
Edges can be flagged as either :None:None:`INLCUDED` which are required to be in the returned tree, :None:None:`EXCLUDED`, which cannot be in the returned tree and :None:None:`OPEN`.
This is used in the SpanningTreeIterator to create new partitions following the algorithm of Sörensen and Janssens .
An undirected graph.
Determines whether the returned tree is the minimum spanning tree of the partition of the maximum one.
Data key to use for edge weights.
The key for the edge attribute containing the partition data on the graph. Edges can be included, excluded or open using the EdgePartition
enum.
If a NaN is found as an edge weight normally an exception is raised. If :None:None:`ignore_nan is True` then that edge is ignored instead.
A minimum spanning tree using all of the included edges in the graph and none of the excluded edges.
Find a spanning tree while respecting a partition of edges.
Hover to see nodes names; edges to Self not shown, Caped at 50 nodes.
Using a canvas is more power efficient and can get hundred of nodes ; but does not allow hyperlinks; , arrows or text (beyond on hover)
SVG is more flexible but power hungry; and does not scale well to 50 + nodes.
All aboves nodes referred to, (or are referred from) current nodes; Edges from Self to other have been omitted (or all nodes would be connected to the central node "self" which is not useful). Nodes are colored by the library they belong to, and scaled with the number of references pointing them