IntervalGraph

edgeCopyToOrigMap

  (Inherited from Graph.)

edgeOrigToCopyMap

  (Inherited from Graph.)

searchOrder

  (Inherited from Graph.)

vertexCopyToOrigMap

  (Inherited from Graph.)

vertexOrigToCopyMap

  (Inherited from Graph.)

edges

  (Inherited from Graph.)

vertices

  (Inherited from Graph.)

addEdge

Overloaded.   (Inherited from Graph.)

addVertex

Overloaded.   (Inherited from Graph.)

addVertexAndOutEdges

  (Inherited from Graph.)

allPairShortestPaths

Overloaded.   (Inherited from Graph.)

assignTreeLevels

  (Inherited from Graph.)

bestTreeRoot

  (Inherited from Graph.)

coarsen

  (Inherited from Graph.)

containsRepeatedEdges

  (Inherited from Graph.)

contractEdge

  (Inherited from Graph.)

convertToStGraph

Overloaded.   (Inherited from Graph.)

convertToStGraphVirtualEnds

The input should be biconnected undirected graph. The output is directed acyclic ST graph. (Inherited from Graph.)

createReverseMaps

  (Inherited from Graph.)

depthFirstSearch

Overloaded.   (Inherited from Graph.)

eliminateIntermediateSourcesAndSinks

  (Inherited from Graph.)

embedOnSameFace

  (Inherited from Graph.)

father

  (Inherited from Graph.)

findPlanarSubgraph

  (Inherited from Graph.)

findPlanarSubgraphByBookEmbedding

  (Inherited from Graph.)

findPlanarSubgraphBySimpleEdgeInsertion

  (Inherited from Graph.)

findShortestPath

Overloaded.   (Inherited from Graph.)

findShortestWeightedPath

Overloaded.   (Inherited from Graph.)

getBiconnectedComponents

Overloaded.   (Inherited from Graph.)

getCanonicalOrder

  (Inherited from Graph.)

getConnectedComponents

  (Inherited from Graph.)

getConnectedComponentsQuickFind

  (Inherited from Graph.)

getConnectedComponentsQuickUnion

  (Inherited from Graph.)

getDualGraph

Overloaded.   (Inherited from Graph.)

getEdgeConnectedComponents

  (Inherited from Graph.)

getEdges

  (Inherited from Graph.)

getIntervals

getLayers

  (Inherited from Graph.)

getLevelPlanarEmbedding

Must be called on a proper hierarchical graph. (Inherited from Graph.)

getPlanarEmbedding

  (Inherited from Graph.)

getStNumbering

Overloaded.   (Inherited from Graph.)

getTreeChildren

  (Inherited from Graph.)

getVertices

  (Inherited from Graph.)

getWeightedTopologicalNumbering

Overloaded.   (Inherited from Graph.)

isAcyclic

  (Inherited from Graph.)

isPlanar

  (Inherited from Graph.)

isProperHierarchical

Must be called on a simple hierarchical graph. (Inherited from Graph.)

isTree

  (Inherited from Graph.)

load

  (Inherited from Graph.)

loadMappings

  (Inherited from Graph.)

makeAcyclic

Must be called on a simple connected graph. (Inherited from Graph.)

makeBiconnected

  (Inherited from Graph.)

makeBimodal

  (Inherited from Graph.)

makeProperHierarchical

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

makeStPlanar

  (Inherited from Graph.)

maximalMatching

  (Inherited from Graph.)

maxWeightedCliqueOfTransitiveDAG

Must be called on a transitive DAG. (Inherited from Graph.)

maxWeightedIndependentSet

minCostPathOrNegativeCycle

  (Inherited from Graph.)

optimalTopologicalNumbering

Overloaded.   (Inherited from Graph.)

partition

  (Inherited from Graph.)

partitionTree

  (Inherited from Graph.)

planarize

Overloaded.   (Inherited from Graph.)

planarMakeBiconnected

Must be called on a planar graph. (Inherited from Graph.)

removeAllEdges

  (Inherited from Graph.)

removeEdge

  (Inherited from Graph.)

removeVertex

  (Inherited from Graph.)

reorderTopologically

  (Inherited from Graph.)

reverse

  (Inherited from Graph.)

save

  (Inherited from Graph.)

saveMappings

  (Inherited from Graph.)

splitToMaxDegree

Overloaded.   (Inherited from Graph.)

topologicalSort

  (Inherited from Graph.)

toString

  (Inherited from Graph.)

triangulate

Overloaded.   (Inherited from Graph.)