EdgePartition.OPEN
EdgePartition.INCLUDED
EdgePartition.EXCLUDED
An enum to store the state of an edge partition. The enum is written to the edges of a graph before being pasted to kruskal_mst_edges
. Options are:
The following pages refer to to this document either explicitly or contain code examples using this.
networkx.algorithms.tree.mst.kruskal_mst_edges
networkx.algorithms.tree.branchings.minimum_spanning_arborescence
networkx.algorithms.tree.branchings.maximum_spanning_arborescence
networkx.algorithms.tree.branchings.maximum_branching
networkx.algorithms.tree.branchings.minimum_branching
networkx.algorithms.tree.mst.partition_spanning_tree
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