P.I.G.A.L.E.
1.3.9
Public Implementation of a Graph Algorithm
Library and Editor
H. de Fraysseix      P. Ossona de Mendez

---

Pigale.h File Reference

---

Detailed Description

Prototypes of non-member functions defined in tgraph.

Include dependency graph for Pigale.h:

This graph shows which files directly or indirectly include this file:

Functions

• int NPBipolar (TopologicalGraph &G, tbrin bst)
• int EmbedGVision (TopologicalGraph &G)
• int TestOuterPlanar (TopologicalGraph &G)
• void ColorPoles (GeometricGraph &G)
• bool CheckCoordNotOverlap (GeometricGraph &G)
• void ComputeGeometricCir (GeometricGraph &G, svector< tbrin > &cir)
• void BFSOrientTree (TopologicalGraph &G, tvertex v0)
• int EmbedTContact (TopologicalGraph &G, bool schnyderLongestFace)
• int EmbedTriangle (TopologicalGraph &G)
• int EmbedFPPRecti (TopologicalGraph &G, bool schnyderLongestFace)
• int EmbedFPP (TopologicalGraph &G, bool schnyderRect, bool schnyderLongestFace)
• int EmbedCCD (TopologicalGraph &G, bool compact)
• int EmbedTutteCircle (TopologicalGraph &G, bool schnyderLongestFace)
• int FindNPSet (TopologicalGraph &)
• int split (Graph &G0, int &NumberOfClasses, int usedDistance)
• int EmbedVision (TopologicalGraph &G)
• int Vision (TopologicalGraph &xG, int morg)
• int EmbedContactBip (GeometricGraph &G)
• int DecompMaxBip (TopologicalGraph &G)
• int Polar (TopologicalGraph &G)
• int Embed3d (TopologicalGraph &G0, int usedDistance)
• int Embed3dbis (TopologicalGraph &G0)
• int Embed3dSchnyder (TopologicalGraph &G0, bool schnyderLongestFace)
• int EmbedPolyline (TopologicalGraph &G)
• int EmbedCurves (TopologicalGraph &G)
• int EmbedPolrecDFS (TopologicalGraph &G)
• int EmbedPolrecBFS (TopologicalGraph &G)
• int EmbedPolrecLR (TopologicalGraph &G)
• GraphContainer * GenerateGrid (int a, int b)
• GraphContainer * GenerateCompleteGraph (int a)
• GraphContainer * GenerateCompleteBiGraph (int a, int b)
• GraphContainer * GenerateRandomGraph (int a, int b, bool randomEraseMultipleEdges)
• GraphContainer * GenerateSchaeffer (int n_ask, int type, int e_connectivity, bool randomEraseMultipleEdges=false, bool randomUseGeneratedCir=false)
• GraphContainer * GenerateRandomOuterplanarGraph (int n, bool randomEraseMultipleEdges)
• GraphContainer * GenerateRandomOuterplanarGraph (int n, int m, bool randomEraseMultipleEdges)
• void shuffleCir (TopologicalGraph &G)

---

Function Documentation

void BFSOrientTree	(	TopologicalGraph &	G,
		tvertex	v0
	)

bool CheckCoordNotOverlap

(

GeometricGraph &

G

)

void ColorPoles

(

GeometricGraph &

G

)

void ComputeGeometricCir	(	GeometricGraph &	G,
		svector< tbrin > &	cir
	)

int DecompMaxBip

(

TopologicalGraph &

G

)

int Embed3d	(	TopologicalGraph &	G0,
		int	usedDistance
	)			[related]

int Embed3dbis

(

TopologicalGraph &

G0

)

int Embed3dSchnyder	(	TopologicalGraph &	G0,
		bool	schnyderLongestFace
	)

int EmbedCCD	(	TopologicalGraph &	G,
		bool	compact
	)

int EmbedContactBip

(

GeometricGraph &

G

)

int EmbedCurves

(

TopologicalGraph &

G

)

int EmbedFPP	(	TopologicalGraph &	G,
		bool	schnyderRect,
		bool	schnyderLongestFace
	)

int EmbedFPPRecti	(	TopologicalGraph &	G,
		bool	schnyderLongestFace
	)

int EmbedGVision

(

TopologicalGraph &

G

)

int EmbedPolrecBFS

(

TopologicalGraph &

G

)

int EmbedPolrecDFS

(

TopologicalGraph &

G

)

int EmbedPolrecLR

(

TopologicalGraph &

G

)

int EmbedPolyline

(

TopologicalGraph &

G

)

int EmbedTContact	(	TopologicalGraph &	G,
		bool	schnyderLongestFace
	)

int EmbedTriangle

(

TopologicalGraph &

G

)

int EmbedTutteCircle	(	TopologicalGraph &	G,
		bool	schnyderLongestFace
	)

int EmbedVision

(

TopologicalGraph &

G

)

int FindNPSet

(

TopologicalGraph &

)

GraphContainer* GenerateCompleteBiGraph	(	int	a,
		int	b
	)

GraphContainer* GenerateCompleteGraph

(

int

a

)

GraphContainer* GenerateGrid	(	int	a,
		int	b
	)

GraphContainer* GenerateRandomGraph	(	int	a,
		int	b,
		bool	randomEraseMultipleEdges
	)

GraphContainer* GenerateRandomOuterplanarGraph	(	int	n,
		int	m,
		bool	randomEraseMultipleEdges
	)

GraphContainer* GenerateRandomOuterplanarGraph	(	int	n,
		bool	randomEraseMultipleEdges
	)

GraphContainer* GenerateSchaeffer	(	int	n_ask,
		int	type,
		int	e_connectivity,
		bool	randomEraseMultipleEdges = false,
		bool	randomUseGeneratedCir = false
	)

int NPBipolar	(	TopologicalGraph &	G,
		tbrin	bst
	)

int Polar

(

TopologicalGraph &

G

)

void shuffleCir

(

TopologicalGraph &

G

)

int split	(	Graph &	G0,
		int &	NumberOfClasses,
		int	usedDistance
	)

Split a graph in a prescribed number of classes.

Parameters:

	G0	a simple graph with at least 3 vertices and 2 edges
	NumberOfClasses	the number of desired classes

Actions:

• creates a SplitGraph which derives from EmbedRnGraph which embeds the graph in
• calls SplitGraph::Segment to perform the partition
• color the vertices according to its class G.ClassNumber[v()]

Parameters:

	G0	Refrence to the topological graph to embed
	NumberOfClasses	Required number of classes

Precondition:

The graph should have at least 3 vertices and 2 edges

int TestOuterPlanar

(

TopologicalGraph &

G

)

int Vision	(	TopologicalGraph &	xG,
		int	morg
	)

---