Planar connectivity augmentation


Functions

void abstractMixedGraph::PlanarConnectivityAugmentation () throw (ERRejected)
void abstractMixedGraph::PlanarBiconnectivityAugmentation () throw (ERRejected)
void abstractMixedGraph::Triangulation () throw (ERRejected)

Function Documentation

void PlanarBiconnectivityAugmentation  )  throw (ERRejected) [inherited]
 

Add arcs to a connected graph so that it becomes biconnected.

This operation runs in linear time and applies to connected planar embedded graph objects only. The initial planar representation is legally extended in the final graph. The augmenting edge set is most likely not minimal.

void PlanarConnectivityAugmentation  )  throw (ERRejected) [inherited]
 

Add arcs until the graph becomes connected.

This operation runs in linear time and applies to all sparse represented graph objects. It the graph in advance is planar [embedded], the final graph is also planar [embedded]. The augmenting edge set is minimal.

void Triangulation  )  throw (ERRejected) [inherited]
 

Augment a biconnected planar graph so that the graph becomes triconnected and all faces become triangles.

This operation runs in linear time and applies to biconnected planar embedded graph objects only. The initial planar representation is legally extended in the final graph.