|
|||||||||||
PREV CLASS NEXT CLASS | FRAMES NO FRAMES | ||||||||||
SUMMARY: NESTED | FIELD | CONSTR | METHOD | DETAIL: FIELD | CONSTR | METHOD |
java.lang.Objectedu.uci.ics.jung.graph.predicates.GPredicate
edu.uci.ics.jung.graph.predicates.EdgePredicate
edu.uci.ics.jung.graph.predicates.SelfLoopEdgePredicate
A predicate that checks to see whether a specified edge is a self-loop.
Field Summary |
Fields inherited from class edu.uci.ics.jung.graph.predicates.GPredicate |
isInitializationPredicate |
Method Summary | |
boolean |
evaluateEdge(ArchetypeEdge e)
Returns true if e is an
Edge that connects a vertex to itself. |
static SelfLoopEdgePredicate |
getInstance()
Returns an instance of this class. |
java.lang.String |
toString()
|
Methods inherited from class edu.uci.ics.jung.graph.predicates.EdgePredicate |
evaluate |
Methods inherited from class java.lang.Object |
equals, getClass, hashCode, notify, notifyAll, wait, wait, wait |
Method Detail |
public static SelfLoopEdgePredicate getInstance()
public java.lang.String toString()
public boolean evaluateEdge(ArchetypeEdge e)
true
if e
is an
Edge
that connects a vertex to itself.
evaluateEdge
in class EdgePredicate
|
|||||||||||
PREV CLASS NEXT CLASS | FRAMES NO FRAMES | ||||||||||
SUMMARY: NESTED | FIELD | CONSTR | METHOD | DETAIL: FIELD | CONSTR | METHOD |