com.mindfusion.graphs.Graph Methods

Graph Methods

CollapseAll image

Members Options: Show All

Include Inherited Members
Include Protected Members

General Information

What's New in this Release

Version History

Programming Interface Overview

com.mindfusion.common

com.mindfusion.drawing

com.mindfusion.graphs

Attribute Class

BimodalSplit Class

BinaryTree(T) Class

BlockCutpointGraph Class

CircularDrawing Class

ComponentBlocksHandler Interface

ConstrainedVisibility Class

DatabaseDrawing Class

DrawingGrid Class

DualGraph Class

EdgeShape Class

Embedding Class

FractalDrawing Class

Graph Constructor

addVertex Method

addVertexAndOutEdges Method

allPairShortestPaths Method

assignTreeLevels Method

bestTreeRoot Method

containsRepeatedEdges Method

contractEdge Method

convertToStGraph Method

convertToStGraphVirtualEnds Method

createReverseMaps Method

depthFirstSearch Method

eliminateIntermediateSourcesAndSinks Method

embedOnSameFace Method

findPlanarSubgraph Method

findPlanarSubgraphByBookEmbedding Method

findPlanarSubgraphBySimpleEdgeInsertion Method

findShortestPath Method

findShortestWeightedPath Method

getBiconnectedComponents Method

getCanonicalOrder Method

getConnectedComponents Method

getConnectedComponentsQuickFind Method

getConnectedComponentsQuickUnion Method

getDualGraph Method

getEdgeConnectedComponents Method

getEdges Method

getLayers Method

getLevelPlanarEmbedding Method

getPlanarEmbedding Method

getStNumbering Method

getTreeChildren Method

getVertices Method

getWeightedTopologicalNumbering Method

isAcyclic Method

isPlanar Method

isProperHierarchical Method

loadMappings Method

makeAcyclic Method

makeBiconnected Method

makeBimodal Method

makeProperHierarchical Method

makeStPlanar Method

maximalMatching Method

maxWeightedCliqueOfTransitiveDAG Method

minCostPathOrNegativeCycle Method

optimalTopologicalNumbering Method

partition Method

partitionTree Method

planarize Method

planarMakeBiconnected Method

removeAllEdges Method

removeEdge Method

removeVertex Method

reorderTopologically Method

saveMappings Method

splitToMaxDegree Method

topologicalSort Method

toString Method

triangulate Method

GridDrawing Class

HierarchicalDrawing Class

HierarchicalEmbedding Class

IntervalGraph Class

LayoutTraits Class

MinBendOrthogonalDrawing Class

OrthogonalDrawing Class

OrthogonalRepresentation Class

OverlapGraph Class

PolylineDrawing Class

PQTree(T) Class

QuasiUpwardDrawing Class

Representation Class

StConversion Class

StEmbedding Class

StPlanarization Class

Tessellation Class

Utilities Class

VertexExchangeGraph Class

VertexSizeFunction Interface

Visibility Class

com.mindfusion.pdf

com.mindfusion.spreadsheet

com.mindfusion.spreadsheet.charts

com.mindfusion.spreadsheet.expressions

com.mindfusion.spreadsheet.standardforms

Function Reference

Technical Support

MindFusion Products

Public Methods

	Name	Description
	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.

See Also

Graph Class
com.mindfusion.graphs Namespace