addEdge

Overloaded.  

addVertex

Overloaded.  

addVertexAndOutEdges

allPairShortestPaths

Overloaded.  

assignTreeLevels

bestTreeRoot

coarsen

containsRepeatedEdges

contractEdge

convertToStGraph

Overloaded.  

convertToStGraphVirtualEnds

The input should be biconnected undirected graph. The output is directed acyclic ST graph.

createReverseMaps

depthFirstSearch

Overloaded.  

eliminateIntermediateSourcesAndSinks

embedOnSameFace

father

findPlanarSubgraph

findPlanarSubgraphByBookEmbedding

findPlanarSubgraphBySimpleEdgeInsertion

findShortestPath

Overloaded.  

findShortestWeightedPath

Overloaded.  

getBiconnectedComponents

Overloaded.  

getCanonicalOrder

getConnectedComponents

getConnectedComponentsQuickFind

getConnectedComponentsQuickUnion

getDualGraph

Overloaded.  

getEdgeConnectedComponents

getEdges

getLayers

getLevelPlanarEmbedding

Must be called on a proper hierarchical graph.

getPlanarEmbedding

getStNumbering

Overloaded.  

getTreeChildren

getVertices

getWeightedTopologicalNumbering

Overloaded.  

isAcyclic

isPlanar

isProperHierarchical

Must be called on a simple hierarchical graph.

isTree

load

loadMappings

makeAcyclic

Must be called on a simple connected graph.

makeBiconnected

makeBimodal

makeProperHierarchical

Replaces long links with a sequence of virtual nodes and links that connect adjacent levels. Must be called on a simple hierarchical graph.

makeStPlanar

maximalMatching

maxWeightedCliqueOfTransitiveDAG

Must be called on a transitive DAG.

minCostPathOrNegativeCycle

optimalTopologicalNumbering

Overloaded.  

partition

partitionTree

planarize

Overloaded.  

planarMakeBiconnected

Must be called on a planar graph.

removeAllEdges

removeEdge

removeVertex

reorderTopologically

reverse

save

saveMappings

splitToMaxDegree

Overloaded.  

topologicalSort

toString

triangulate

Overloaded.