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

---

graphs.h File Reference

Include dependency graph for graphs.h:

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

Classes

• class Graph
• class TopologicalGraph
• class GeometricGraph

Defines

• #define Forall_adj_brins(b, v, G)   for(b=G.FirstBrin(v);b!=0;b=G.NextBrin(v,b))
• #define Forall_adj_edges(e, v, G)   for(e=G.FirstEdge(v);e!=0;e=G.NextEdge(v,e))
• #define Forall_adj_brins_of_G(b, v)   for(b=FirstBrin(v);b!=0;b=NextBrin(v,b))
• #define Forall_adj_edges_of_G(e, v)   for(e=FirstEdge(v);e!=0;e=NextEdge(v,e))

Functions

• int bicon (int n, int m, const svector< tvertex > &nvin, _Bicon &Bicon, svector< tvertex > &low)

---

Define Documentation

#define Forall_adj_brins	(	b,
		v,
		G		)	for(b=G.FirstBrin(v);b!=0;b=G.NextBrin(v,b))

#define Forall_adj_brins_of_G	(	b,
		v		)	for(b=FirstBrin(v);b!=0;b=NextBrin(v,b))

#define Forall_adj_edges	(	e,
		v,
		G		)	for(e=G.FirstEdge(v);e!=0;e=G.NextEdge(v,e))

#define Forall_adj_edges_of_G	(	e,
		v		)	for(e=FirstEdge(v);e!=0;e=NextEdge(v,e))

---

Function Documentation

int bicon	(	int	n,
		int	m,
		const svector< tvertex > &	nvin,
		_Bicon &	Bicon,
		svector< tvertex > &	low
	)

---