boruvka_mst_edges(G, minimum=True, weight='weight', keys=False, data=True, ignore_nan=False)
The edges of G must have distinct weights, otherwise the edges may not form a tree.
Find the minimum (True) or maximum (False) spanning tree.
The name of the edge attribute holding the edge weights.
This argument is ignored since this function is not implemented for multigraphs; it exists only for consistency with the other minimum spanning tree functions.
Flag for whether to yield edge attribute dicts. If True, yield edges :None:None:`(u, v, d)`, where d is the attribute dict. If False, yield edges :None:None:`(u, v)`.
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.
Iterate over edges of a Borůvka's algorithm min/max 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