|
GraphLab Project | |||||||||
PREV CLASS NEXT CLASS | FRAMES NO FRAMES | |||||||||
SUMMARY: NESTED | FIELD | CONSTR | METHOD | DETAIL: FIELD | CONSTR | METHOD |
java.lang.Objectgraphlab.library.algorithms.Algorithm
graphlab.library.algorithms.util.AcyclicChecker
public class AcyclicChecker
Checks whether a graph is acyclic. Usage:
graphlab.library.algorithms.util.AcyclicChecker.isGraphAcyclic(graph); The above statement returns true if the graph is acyclic. The graph parameter is your graph object. Note that there is no need to explicitly parameterize the generic method isGraphAcyclic. Types are automatically deduced from the supplied graph object with no java unchecked convertion warning.
Constructor Summary | |
---|---|
AcyclicChecker()
|
Method Summary | ||
---|---|---|
void |
doAlgorithm()
|
|
static
|
isGraphAcyclic(BaseGraph<VertexType,EdgeType> graph)
Checks whether the current graph is acyclic. |
Methods inherited from class graphlab.library.algorithms.Algorithm |
---|
acceptEventDispatcher, dispatchEvent, getDispatcher |
Methods inherited from class java.lang.Object |
---|
clone, equals, finalize, getClass, hashCode, notify, notifyAll, toString, wait, wait, wait |
Methods inherited from interface graphlab.library.algorithms.AlgorithmInterface |
---|
acceptEventDispatcher |
Constructor Detail |
---|
public AcyclicChecker()
Method Detail |
---|
public static <VertexType extends BaseVertex,EdgeType extends BaseEdge<VertexType>> boolean isGraphAcyclic(BaseGraph<VertexType,EdgeType> graph)
InvalidGraphException
public void doAlgorithm()
doAlgorithm
in interface AutomatedAlgorithm
|
GraphLab Project | |||||||||
PREV CLASS NEXT CLASS | FRAMES NO FRAMES | |||||||||
SUMMARY: NESTED | FIELD | CONSTR | METHOD | DETAIL: FIELD | CONSTR | METHOD |