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

DFSKura2 Member List

This is the complete list of members for DFSKura2, including all inherited members.

Generated on Thu Jan 31 16:51:44 2008 for Pigale by

_ib	DFSGraph
ancestor	DFSKura2	`[private]`
ancestor_son	DFSKura2	`[private]`
bicon()	DFSGraph
branch	DFSKura2	`[private]`
ClearKeep()	GraphAccess	`[inline]`
Comparable(tvertex v, tvertex w)	DFSKura2	`[inline]`
ComparableDifferent(tvertex v, tvertex w)	DFSKura2	`[inline]`
Compute()	DFSKura2	`[protected]`
ComputeAncestors()	DFSKura2
ComputeDegrees()	DFSGraph
ComputeDownEdge()	DFSKura2	`[protected]`
ComputeImportantVertices()	DFSKura2	`[inline, protected]`
Container()	GraphAccess	`[inline]`
Container() const	GraphAccess	`[inline]`
CotreeCritical()	DFSGraph
cover(tvertex from, tvertex to)	DFSKura2
decsize(const tvertex &v)	GraphAccess	`[inline]`
decsize(const tedge &e)	GraphAccess	`[inline]`
DeleteCotreeEdge(tedge e)	DFSGraph
DFSDualOrder()	DFSKura2
DFSGraph(GraphContainer &GC, Graph &GG, tbrin b0=1)	DFSGraph	`[inline]`
DFSGraph(GraphContainer &GC, DFSGraph &GG)	DFSGraph	`[inline]`
DFSGraph(DFSGraph &DG)	DFSGraph	`[inline]`
DFSKura(DFSGraph &DG)	DFSKura	`[inline]`
DFSKura2(DFSGraph &DG)	DFSKura2	`[inline]`
DoDFS(tbrin b0=1)	DFSGraph
down_edge	DFSKura2	`[private]`
down_edge_equal	DFSKura2	`[private]`
down_vertex	DFSKura2	`[private]`
DualOrder	DFSKura2	`[private]`
e1	DFSKura
e2	DFSKura
ecolor	DFSKura
EgaliteBasse	DFSKura
elabel	DFSKura
elow	DFSKura2	`[private]`
ewidth	DFSKura
father(tvertex v)	DFSGraph	`[inline]`
fils1	DFSKura2	`[private]`
fils2	DFSKura2	`[private]`
FindInterlaced(tedge e, tvertex lv, tvertex tv)	DFSKura2	`[protected]`
FindLastInterlaced(tedge e, tvertex lv, tvertex tv)	DFSKura2	`[protected]`
FindLowEdge(tedge e)	DFSKura2	`[inline, protected]`
Flash(tedge e, short c)	DFSKura2	`[inline]`
FlashBest(tedge e, short c)	DFSKura2	`[inline]`
G	DFSGraph
GetRetVal()	DFSKura2	`[inline]`
GraphAccess(GraphContainer &G)	GraphAccess	`[inline]`
GraphAccess(GraphAccess &G)	GraphAccess	`[inline]`
Gvin	DFSGraph
HighestCove(tvertex v1, tvertex v2)	DFSKura2
ib(tbrin b)	DFSGraph	`[inline]`
ie(tedge e)	DFSGraph	`[inline]`
incsize(const tvertex &v)	GraphAccess	`[inline]`
incsize(const tedge &e)	GraphAccess	`[inline]`
infimum(tvertex v, tvertex w)	DFSKura2
Interlaced(tedge e, tedge f)	DFSKura2	`[inline]`
IsDownEdgeEqualOk(tedge e)	DFSKura2	`[inline, protected]`
IsDownEdgeOk(tedge e)	DFSKura2	`[inline, protected]`
IsNPEdgeOk(tedge e)	DFSKura2	`[inline, protected]`
isplanar	DFSKura
iv(tvertex v)	DFSGraph	`[inline]`
Keep(tedge e, short c)	DFSKura2	`[inline, protected]`
keeponly()	GraphAccess	`[inline]`
keepr()	GraphAccess	`[inline]`
KuraFound()	DFSKura2	`[inline]`
Kuratowski()	DFSGraph
l1	DFSKura2	`[private]`
l2	DFSKura2	`[private]`
lastc	DFSKura2	`[private]`
laste	DFSKura2	`[private]`
low	DFSKura2	`[private]`
lp	DFSKura2	`[private]`
mark	DFSKura2	`[private]`
MarkFundTree()	DFSGraph
MarkKuratowski()	DFSGraph
me()	GraphAccess	`[inline]`
me() const	GraphAccess	`[inline]`
nbre(const tvertex &) const	GraphAccess	`[inline]`
nbre(const tedge &) const	GraphAccess	`[inline]`
ne() const	GraphAccess	`[inline]`
NewCotreeEdge(tvertex v1, tvertex v2, tbrin ibe=0)	DFSGraph	`[inline]`
np	DFSKura
npattach	DFSKura2	`[private]`
nv() const	GraphAccess	`[inline]`
nvin	DFSGraph
operator=(const GraphContainer &G)	GraphAccess	`[inline]`
OrdChainInterlaced(tedge e, tedge f)	DFSKura2	`[inline]`
OrdInterlaced(tedge e, tedge f)	DFSKura2	`[inline]`
PB()	GraphAccess	`[inline]`
PE()	GraphAccess	`[inline]`
PG()	GraphAccess	`[inline]`
Planarity()	DFSGraph
PV()	GraphAccess	`[inline]`
reset()	GraphAccess	`[inline]`
RetVal	DFSKura2	`[private]`
rG	GraphAccess	`[protected]`
Set(const tvertex &)	GraphAccess	`[inline]`
Set(const tedge &)	GraphAccess	`[inline]`
Set(const tbrin &)	GraphAccess	`[inline]`
Set()	GraphAccess	`[inline]`
setsize(const tvertex &v, int i)	GraphAccess	`[inline]`
setsize(const tedge &e, int i)	GraphAccess	`[inline]`
setsize(int nn, int mm)	GraphAccess	`[inline]`
Shrink()	DFSGraph
ShrinkCotree()	DFSGraph
ShrinkSubdivision()	DFSGraph
ShrinkToNonPlanar(bool show=false)	DFSKura
SmallerEqual(tvertex v, tvertex w)	DFSKura2	`[inline]`
SmallerThan(tvertex v, tvertex w)	DFSKura2	`[inline]`
StrictReset()	GraphAccess	`[inline]`
Success	DFSKura2	`[private]`
SwapInOrder(tedge &e, tedge &f)	DFSGraph	`[inline]`
t1	DFSKura2	`[private]`
t2	DFSKura2	`[private]`
TestPlanar()	DFSGraph
treein(tvertex v)	DFSGraph	`[inline]`
treetarget(tedge e)	DFSGraph	`[inline]`
Tswap(GraphContainer &G)	GraphAccess	`[inline]`
UnKeep(tedge e, short c)	DFSKura2	`[inline, protected]`
uptree	DFSGraph
vcolor	DFSKura
~DFSGraph()	DFSGraph	`[inline]`
~DFSKura()	DFSKura	`[inline]`
~DFSKura2()	DFSKura2	`[inline]`
~GraphAccess()	GraphAccess	`[inline]`