_without_most_central_edges(G, most_valuable_edge)
:None:None:`G` must be a non-empty graph. This function modifies the graph :None:None:`G` in-place; that is, it removes edges on the graph :None:None:`G`.
:None:None:`most_valuable_edge` is a function that takes the graph :None:None:`G` as input (or a subgraph with one or more edges of :None:None:`G` removed) and returns an edge. That edge will be removed and this process will be repeated until the number of connected components in the graph increases.
Returns the connected components of the graph that results from repeatedly removing the most "valuable" edge in the graph.
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