com.aoindustries.util.graph

Class SymmetricAcyclicGraphChecker<V,EX extends Exception>

java.lang.Object

com.aoindustries.util.graph.SymmetricAcyclicGraphChecker<V,EX>

All Implemented Interfaces:

GraphChecker<EX>

public class SymmetricAcyclicGraphChecker<V,EX extends Exception>
extends Object
implements GraphChecker<EX>

A symmetric directed acyclic graph checker.

Author:

AO Industries, Inc.

Constructor Summary

Constructors

Constructor and Description
SymmetricAcyclicGraphChecker(SymmetricMultiGraph<V,?,? extends EX> graph, boolean isForward)

Method Summary

Modifier and Type	Method and Description
void	checkGraph() Test the graph for cycles and makes sure that all connections are consistent with back connections.

Methods inherited from class java.lang.Object

clone, equals, finalize, getClass, hashCode, notify, notifyAll, toString, wait, wait, wait

Constructor Detail

SymmetricAcyclicGraphChecker

public SymmetricAcyclicGraphChecker(SymmetricMultiGraph<V,?,? extends EX> graph,
                                    boolean isForward)

Method Detail

checkGraph

public void checkGraph()
                throws AsymmetricException,
                       CycleException,
                       EX extends Exception

Test the graph for cycles and makes sure that all connections are consistent with back connections. Cycle algorithm adapted from: http://www.personal.kent.edu/~rmuhamma/Algorithms/MyAlgorithms/GraphAlgor/depthSearch.htm http://www.eecs.berkeley.edu/~kamil/teaching/sp03/041403.pdf In the case of a multigraph, any number of edges one direction is considered a match to any number of edges back. The number does not need to be equal.

Specified by:

checkGraph in interface GraphChecker<EX extends Exception>

Throws:

AsymmetricException - where the edges are not symmetric

CycleException - if there is a cycle in the graph

EX extends Exception