edu.uci.ics.jung.graph.predicates
Class SimpleEdgePredicate
java.lang.Object
edu.uci.ics.jung.graph.predicates.GPredicate
edu.uci.ics.jung.graph.predicates.EdgePredicate
edu.uci.ics.jung.graph.predicates.SimpleEdgePredicate
- All Implemented Interfaces:
- Predicate
public class SimpleEdgePredicate
- extends EdgePredicate
A predicate that tests to see whether a specified edge is
"simple" (neither parallel to any edge nor a self-loop).
This predicate may be used as an edge constraint; a graph
with this edge constraint will be a simple graph.
- Author:
- Joshua O'Madadhain
SimpleEdgePredicate
protected SimpleEdgePredicate()
getInstance
public static SimpleEdgePredicate getInstance()
- Returns an instance of this class.
toString
public String toString()
- Overrides:
toString
in class Object
evaluateEdge
public boolean evaluateEdge(ArchetypeEdge ae)
- Returns
true
if ae
is neither a
self-loop nor parallel to an existing edge.
- Specified by:
evaluateEdge
in class EdgePredicate