edu.uci.ics.jung.graph.predicates
Class SelfLoopEdgePredicate

java.lang.Object
  extended byedu.uci.ics.jung.graph.predicates.GPredicate
      extended byedu.uci.ics.jung.graph.predicates.EdgePredicate
          extended byedu.uci.ics.jung.graph.predicates.SelfLoopEdgePredicate
All Implemented Interfaces:
org.apache.commons.collections.Predicate

public class SelfLoopEdgePredicate
extends EdgePredicate

A predicate that checks to see whether a specified edge is a self-loop.

Author:
Joshua O'Madadhain

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

getInstance

public static SelfLoopEdgePredicate getInstance()
Returns an instance of this class.


toString

public java.lang.String toString()

evaluateEdge

public boolean evaluateEdge(ArchetypeEdge e)
Returns true if e is an Edge that connects a vertex to itself.

Specified by:
evaluateEdge in class EdgePredicate