EDU.auburn.VGJ.algorithm.cartegw
Class BiconnectGraph
java.lang.Object
EDU.auburn.VGJ.graph.Graph
EDU.auburn.VGJ.algorithm.cartegw.BiconnectGraph
- All Implemented Interfaces:
- java.lang.Cloneable, GraphAlgorithm
- public class BiconnectGraph
- extends Graph
- implements GraphAlgorithm
Class to transform the given graph to a biconnected graph.
Here is the source.
Methods inherited from class EDU.auburn.VGJ.graph.Graph |
children, clone, copy, dummysToEdgePaths, firstAvailable, firstNode, firstNodeIndex, getEdge, getEdgePathPoints, getEdges, getIndexFromNode, getNodeFromId, getNodeFromIndex, group, highestIndex, insertEdge, insertEdge, insertEdge, insertEdge, insertNode, insertNode, insertNodeAt, isDirected, killGroup, nextNode, nextNodeIndex, nodeFromIndex, numberOfNodes, pack, parents, removeEdge, removeEdge, removeEdgePaths, removeGroups, removeNode, removeNode, setDirected, setGMLvalues, setNodeGroup |
Methods inherited from class java.lang.Object |
equals, finalize, getClass, hashCode, notify, notifyAll, toString, wait, wait, wait |
BiconnectGraph
public BiconnectGraph(boolean state)
BiconnectGraph
public BiconnectGraph()
FindArticulationPoints
public boolean FindArticulationPoints(Graph G,
Graph dfsTree)
FAP
public boolean FAP(Graph G,
Graph dfsTree,
Node dfsRoot,
Node v,
Node u,
int count,
boolean foundArtPnt)
ArticulationPoints2String
public java.lang.String ArticulationPoints2String(Graph G)
compute
public java.lang.String compute(Graph graph,
GraphUpdate update)
- Description copied from interface:
GraphAlgorithm
- Apply the algorithm to graph. The return value should be null
if successful, and an error message if unsuccessful.
- Specified by:
compute
in interface GraphAlgorithm
- Parameters:
update
- an object that allows the display to be updated
from within the algorithm- See Also:
GraphUpdate