tlp Namespace Reference


Functions

void canonicalOrdering (SuperGraph *graph, vector< node > &order)
void triangulate (SuperGraph *graph, vector< edge > &addedEdges)
void triangulate (SuperGraph *map, std::vector< edge > &addedEdges)
void canonicalOrdering (SuperGraph *graph, std::vector< node > &order)


Function Documentation

void tlp::canonicalOrdering SuperGraph *  graph,
std::vector< node > &  order
 

Build the canonical ordering of a planar triangulated graph. For information about canonical ordering the user must reffer to the planar graph drawing book.

void tlp::canonicalOrdering SuperGraph *  graph,
vector< node > &  order
 

void tlp::triangulate SuperGraph *  map,
std::vector< edge > &  addedEdges
 

This function triangulate a planar graph. (ie. add edges in the graph until each face of the planar map contains only 3 edges. The input graph must be planr in order to call this function.

void tlp::triangulate SuperGraph *  graph,
vector< edge > &  addedEdges
 


Generated on Fri Jan 5 14:21:56 2007 for Tulip Plugins by  doxygen 1.4.6