branching_weight(G, attr='weight', default=1)
You must access this function through the networkx.algorithms.tree module.
The directed graph.
The attribute to use as weights. If None, then each edge will be treated equally with a weight of 1.
When attr
is not None, then if an edge does not have that attribute, default
specifies what value it should take.
The total weight of the branching.
Returns the total weight of a branching.
>>> G = nx.DiGraph()See :
... G.add_weighted_edges_from([(0, 1, 2), (1, 2, 4), (2, 3, 3), (3, 4, 2)])
... nx.tree.branching_weight(G) 11
The following pages refer to to this document either explicitly or contain code examples using this.
networkx.algorithms.tree.branchings.branching_weight
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