A graph G is biconnected if, for every pair of vertices u,v in
G, there is a cycle containing both u and v.
Alternatively, a graph is biconnected if it is connected and cannot be made
disconnected by removing any single vertex. make_biconnected_planar
takes a connectedplanar graph g as input and adds zero
or more edges to make g biconnected while preserving planarity.
The default behavior of make_biconnected_planar is to modify the
graph g by calling add_edge(u,v,g) for every pair of
vertices (u,v) where an edge needs to be added to make g
biconnected. This behavior can be overriden by providing a vistor as the
AddEdgeVisitor parameter. The only requirement for an
AddEdgeVisitor is that it define a member function with the
following signature:
This event point can also be used as a hook to update the underlying edge
index map automatically as edges are added. See the
documentation for the AddEdgeVisitor
concept for more information.
