bridge_augmentation(G, avail=None, weight=None)
Equivalent to k_edge_augmentation
when k=2, and partial=False. Adding the resulting edges to G will make it 2-edge-connected. If no constraints are specified the returned set of edges is minimum an optimal, otherwise the solution is approximated.
If there are no constraints the solution can be computed in linear time using unconstrained_bridge_augmentation
. Otherwise, the problem becomes NP-hard and is the solution is approximated by weighted_bridge_augmentation
.
An undirected graph.
For more details, see k_edge_augmentation
.
key to use to find weights if avail
is a set of 3-tuples. For more details, see k_edge_augmentation
.
If no bridge-augmentation exists.
Finds the a set of edges that bridge connects G.
Edges in the bridge-augmentation of G
k_edge_augmentation
func
The following pages refer to to this document either explicitly or contain code examples using this.
networkx.algorithms.connectivity.edge_augmentation.weighted_bridge_augmentation
networkx.algorithms.connectivity.edge_augmentation.unconstrained_bridge_augmentation
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