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

---

lralgo.h File Reference

Include dependency graph for lralgo.h:

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

Classes

• struct _Hist
• struct _FastHist
• struct _LrSort

Defines

• #define GAUCHE   0
• #define DROITE   1
• #define AUTRE   2
• #define PLANAR   0
• #define NONPLANAR   1
• #define FIN   2
• #define AGAIN   1
• #define STOP   0

Functions

• tedge treein (tvertex v)
• tvertex treetarget (tedge e)
• void LralgoSort (int n, int m, svector< tvertex > &vin, const _Bicon &Bicon, const svector< tvertex > &low, _LrSort &LrSort)
• void NewLralgoSort (int n, int m, svector< tvertex > &vin, const _Bicon &Bicon, const svector< tvertex > &low, _LrSort &LrSort)
• int lralgo (int n, int m, svector< tvertex > &vin, const _Bicon &Bicon, const _LrSort &LrSort, _Hist &Hist, bool OnlyTest=false)
• int Newlralgo (int n, int m, svector< tvertex > &vin, const _Bicon &Bicon, const _LrSort &LrSort, _Hist &Hist, bool OnlyTest=false)
• int fastlralgo (int n, int m, svector< tvertex > &vin, const _Bicon &Bicon, _LrSort &LrSort, _FastHist &Hist)
• int Newfastlralgo (int n, int m, svector< tvertex > &vin, const _Bicon &Bicon, _LrSort &LrSort)

---

Define Documentation

#define AGAIN   1

#define AUTRE   2

#define DROITE   1

#define FIN   2

#define GAUCHE   0

#define NONPLANAR   1

#define PLANAR   0

#define STOP   0

---

Function Documentation

int fastlralgo	(	int	n,
		int	m,
		svector< tvertex > &	vin,
		const _Bicon &	Bicon,
		_LrSort &	LrSort,
		_FastHist &	Hist
	)

int lralgo	(	int	n,
		int	m,
		svector< tvertex > &	vin,
		const _Bicon &	Bicon,
		const _LrSort &	LrSort,
		_Hist &	Hist,
		bool	OnlyTest = false
	)

void LralgoSort	(	int	n,
		int	m,
		svector< tvertex > &	vin,
		const _Bicon &	Bicon,
		const svector< tvertex > &	low,
		_LrSort &	LrSort
	)

int Newfastlralgo	(	int	n,
		int	m,
		svector< tvertex > &	vin,
		const _Bicon &	Bicon,
		_LrSort &	LrSort
	)

int Newlralgo	(	int	n,
		int	m,
		svector< tvertex > &	vin,
		const _Bicon &	Bicon,
		const _LrSort &	LrSort,
		_Hist &	Hist,
		bool	OnlyTest = false
	)

void NewLralgoSort	(	int	n,
		int	m,
		svector< tvertex > &	vin,
		const _Bicon &	Bicon,
		const svector< tvertex > &	low,
		_LrSort &	LrSort
	)

tedge treein

(

tvertex

v

)

[inline]

tvertex treetarget

(

tedge

e

)

[inline]

---