SourceForge Logo
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

TopologicalGraph Member List

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

_VertexQuadrangulate(bool First)TopologicalGraph
acirTopologicalGraph
AngleGraph()TopologicalGraph
BFS(svector< int > &comp)TopologicalGraph
Biconnect()TopologicalGraph
BipolarPlan(tbrin FirstBrin)TopologicalGraph
BissectEdge(const tedge &e)TopologicalGraph
CheckAcyclic(int &ns, int &nt)TopologicalGraph
CheckBiconnected()TopologicalGraph
CheckBipartite(bool Color=false)TopologicalGraph
CheckConnected()TopologicalGraph
CheckFourconnected()TopologicalGraph
CheckHypergraph(tvertex v0, bool v0ise=false)TopologicalGraph
CheckNoC3Sep()TopologicalGraph
CheckNoLoops()TopologicalGraph
CheckPlanar()TopologicalGraph [inline]
CheckRegular(int &d)TopologicalGraph
CheckSerieParallel()TopologicalGraph
CheckSimple()TopologicalGraph
CheckSubdivTriconnected()TopologicalGraph
CheckTriconnected()TopologicalGraph
cirTopologicalGraph
ClearKeep()GraphAccess [inline]
ColorConnectedComponents()TopologicalGraph
ComputeFpbrin()TopologicalGraph
ComputeGenus()TopologicalGraph
ComputeSTlist(tbrin st_brin)TopologicalGraph [protected]
ConstructedCirTopologicalGraph
ConstructedPbrinTopologicalGraph
Container()GraphAccess [inline]
Container() const GraphAccess [inline]
ContractEdge(const tedge &e)TopologicalGraph
CotreeCritical(int &ret)TopologicalGraph
CotreeCritical(svector< bool > &mark)TopologicalGraph
CrossingEdgesGraph()TopologicalGraph
DebugCir()TopologicalGraph
decsize(const tvertex &v)GraphAccess [inline]
decsize(const tedge &e)GraphAccess [inline]
Degree(const tvertex &v)TopologicalGraph
DeleteEdge(const tedge &e)TopologicalGraph
DeleteVertex(const tvertex &v)TopologicalGraph
DFS(svector< tvertex > &nvin, svector< tbrin > &tb, svector< int > &dfsnum, tbrin b0=tbrin(1))TopologicalGraph
DFS(svector< tvertex > &nvin, tbrin b0=tbrin(1))TopologicalGraph
DFSRenum(svector< tvertex > &nvin, svector< tedge > &ie, tbrin b0=tbrin(1))TopologicalGraph
DualGraph()TopologicalGraph
ExpandEdges()TopologicalGraph
extbrinTopologicalGraph
FaceLength(const tbrin &b0)TopologicalGraph [inline]
FaceNumberIsthmus(const tbrin &b0)TopologicalGraph
FaceWalkLength(const tbrin &b0)TopologicalGraph
FindPlanarMap()TopologicalGraph
FirstBrin(const tvertex &v) const TopologicalGraph [inline]
FirstEdge(const tvertex &v) const TopologicalGraph [inline]
FixOrientation()TopologicalGraph
GDFS(const svector< tbrin > &cir, svector< tvertex > &nvin, svector< tbrin > &tb, svector< int > &dfsnum)Graph
GDFS(const svector< tbrin > &cir, svector< tvertex > &nvin)Graph [inline]
GDFSRenum(const svector< tbrin > &cir, svector< tvertex > &nvin)Graph
genusTopologicalGraph
Genus()TopologicalGraph [inline]
Graph(GraphContainer &G)Graph [inline]
Graph(GraphAccess &G)Graph [inline]
GraphAccess(GraphContainer &G)GraphAccess [inline]
GraphAccess(GraphAccess &G)GraphAccess [inline]
IdentifyEdge(tvertex &v1, tvertex &v2)TopologicalGraph
incsize(const tvertex &v)GraphAccess [inline]
incsize(const tedge &e)GraphAccess [inline]
InDegree(const tvertex &v)TopologicalGraph
InfOrient()TopologicalGraph
init()TopologicalGraph
InsertBrin(const tvertex &v, const tbrin &b)TopologicalGraph [protected]
KCotreeCritical(int &)TopologicalGraph
keep()TopologicalGraph [inline]
keeponly()TopologicalGraph [inline]
keepr()TopologicalGraph [inline]
KKuratowski()TopologicalGraph
Kuratowski()TopologicalGraph
Kuratowski(svector< bool > &mark)TopologicalGraph
LongestFace(tbrin &b, int &len)TopologicalGraph
LongestFaceWalk(tbrin &b, int &len)TopologicalGraph
MakeConnected(bool mark_roots=false)TopologicalGraph
MakeConnectedVertex()TopologicalGraph
MaxPlanar()TopologicalGraph
MaxPlanar(svector< bool > &mark)TopologicalGraph
me()TopologicalGraph [inline]
me() const TopologicalGraph [inline]
MinMaxDegree(int &dmin, int &dmax)TopologicalGraph
MoveBrin(const tbrin &b, const tvertex &to)TopologicalGraph
MoveBrinToFirst(const tbrin &b)TopologicalGraph
nbre(const tvertex &) const GraphAccess [inline]
nbre(const tedge &) const GraphAccess [inline]
ne() const GraphAccess [inline]
NewEdge(const tbrin &ref1, const tbrin &ref2)TopologicalGraph
NewEdge(const tvertex &vv1, const tvertex &vv2, tedge e0=0)TopologicalGraph
NewPlanarity(tbrin b0=1)TopologicalGraph
NewSwapLabel(const tbrin &b, const tedge &ref)TopologicalGraph [inline, protected]
NewVertex()TopologicalGraph
NextBrin(tvertex v, tbrin b) const TopologicalGraph [inline]
NextCirBrin(const tbrin &b) const TopologicalGraph [inline]
NextCirEdge(tvertex v, tedge e) const TopologicalGraph [inline]
NextEdge(const tvertex &v, const tedge &e) const TopologicalGraph [inline]
NpBiconnect(bool withVertices=false)TopologicalGraph
NpBiconnectVertex()TopologicalGraph
NumberOfConnectedComponents()TopologicalGraph [inline]
NumFaces()TopologicalGraph
nv() const GraphAccess [inline]
operator=(const GraphContainer &G)GraphAccess [inline]
Opt2Biconnect()TopologicalGraph
Opt6Biconnect()TopologicalGraph
OutDegree(const tvertex &v)TopologicalGraph
PB()GraphAccess [inline]
pbrinTopologicalGraph
PE()GraphAccess [inline]
PG()GraphAccess [inline]
Planarity(tbrin b0=1)TopologicalGraph
planarMapTopologicalGraph
PrepDFS(svector< tbrin > &cir, tbrin b0=1)Graph
PrevBrin(tvertex v, tbrin b) const TopologicalGraph [inline]
PrevCirBrin(const tbrin &b) const TopologicalGraph [inline]
PrevCirEdge(const tvertex &v, const tedge &e) const TopologicalGraph [inline]
PrevEdge(const tvertex &v, const tedge &e) const TopologicalGraph [inline]
PrivateReverseEdge(const tedge &e)TopologicalGraph [protected]
PseudoBipolarPlan(tbrin &st_brin, int &NumberOfSinks)TopologicalGraph
PV()GraphAccess [inline]
RemoveIsolatedVertices()TopologicalGraph
RemoveIsthmus()TopologicalGraph
RemoveLoops()TopologicalGraph
reset()GraphAccess [inline]
RestoreOrientation()TopologicalGraph
ReverseEdge(const tedge &e)TopologicalGraph
rGGraphAccess [protected]
Rotate(tedge e)TopologicalGraph
Schnyder(bool schnyderRect, bool schnyderColor, bool schnyderLongestFace, tbrin FirstBrin)TopologicalGraph
SchnyderOrient(tbrin FirstBrin)TopologicalGraph
SchnyderV(bool schnyderRect, bool schnyderColor, bool schnyderLongestFace, tbrin FirstBrin)TopologicalGraph
SchnyderXYZ(bool schnyderColor, bool schnyderLongestFace, tbrin FirstBrin, svector< int > &x, svector< int > &y, svector< int > &z)TopologicalGraph
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]
Simplify()TopologicalGraph
SmallDup() const TopologicalGraph
StrictReset()TopologicalGraph [inline]
SwapEdge(const tedge &e)TopologicalGraph [protected]
SwapVertex(const tvertex &v)TopologicalGraph [protected]
SwitchOrientations()TopologicalGraph
TestNewPlanar()TopologicalGraph
TestPlanar()TopologicalGraph
TestPlanar2()TopologicalGraph
TopologicalGraph(Graph &G, int)TopologicalGraph [inline]
TopologicalGraph(GraphContainer &G)TopologicalGraph [inline]
TopologicalGraph(GraphAccess &G)TopologicalGraph [inline]
TopSort(svector< tbrin > &topin, svector< tvertex > &order, bool revert=false)TopologicalGraph
Tricon3orient()TopologicalGraph
TriconTriangulate()TopologicalGraph
Tswap(GraphContainer &G)GraphAccess [inline]
UnlinkBrin(const tbrin &b)TopologicalGraph [protected]
VertexQuadrangulate()TopologicalGraph
VertexTriangulate()TopologicalGraph
vinGraph
Vis_a_vis_Graph()TopologicalGraph
ZigZag(tbrin start)TopologicalGraph
ZigZag()TopologicalGraph [protected]
ZigZagTriangulate()TopologicalGraph
~Graph()Graph [inline]
~GraphAccess()GraphAccess [inline]
~TopologicalGraph()TopologicalGraph [inline]


Generated on Thu Jan 31 16:52:13 2008 for Pigale by  doxygen 1.5.4