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

---

MaxPlanar.cpp File Reference

Include dependency graph for MaxPlanar.cpp:

Functions

• tedge EraseMostMarkedEdge (TopologicalGraph &G0, svector< int > &count)
• void ReinsertSomeEdges (TopologicalGraph &G, TopologicalGraph &G0, svector< tedge > &tab, int &n)
• int FindNPSet (TopologicalGraph &G, svector< tedge > &tab)
• tedge EraseMostMarkedEdge (TopologicalGraph &G0, svector< bool > &mark, svector< int > &count)
• int FindNPSet (TopologicalGraph &G, svector< bool > &mark, svector< tedge > &tab)
• int FindNPSet (TopologicalGraph &G)

---

Function Documentation

tedge EraseMostMarkedEdge	(	TopologicalGraph &	G0,
		svector< bool > &	mark,
		svector< int > &	count
	)

tedge EraseMostMarkedEdge	(	TopologicalGraph &	G0,
		svector< int > &	count
	)

int FindNPSet

(

TopologicalGraph &

G

)

int FindNPSet	(	TopologicalGraph &	G,
		svector< bool > &	mark,
		svector< tedge > &	tab
	)

int FindNPSet	(	TopologicalGraph &	G,
		svector< tedge > &	tab
	)

void ReinsertSomeEdges	(	TopologicalGraph &	G,
		TopologicalGraph &	G0,
		svector< tedge > &	tab,
		int &	n
	)

---