Overview | Package | Class | Use | Tree | Deprecated | Index | Help
PREV CLASS NEXT CLASS | FRAMES NO FRAMES
SUMMARY: NESTED | FIELD | CONSTR | METHOD | DETAIL: FIELD | CONSTR | METHOD

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

    java.lang.Object
      edu.uci.ics.jung.graph.predicates.GPredicate
          edu.uci.ics.jung.graph.predicates.EdgePredicate
              edu.uci.ics.jung.graph.predicates.SelfLoopEdgePredicate

All Implemented Interfaces:
  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`

Constructor Summary
`protected` | `SelfLoopEdgePredicate()`

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.
`String` | `toString()`

Methods inherited from class edu.uci.ics.jung.graph.predicates.EdgePredicate
`evaluate`

Methods inherited from class java.lang.Object
`clone, equals, finalize, getClass, hashCode, notify, notifyAll, wait, wait, wait`

Constructor Detail

### SelfLoopEdgePredicate

    protected SelfLoopEdgePredicate()

Method Detail

### getInstance

    public static SelfLoopEdgePredicate getInstance()

  Returns an instance of this class.

### toString

    public 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`

Overview | Package | Class | Use | Tree | Deprecated | Index | Help
PREV CLASS NEXT CLASS | FRAMES NO FRAMES
SUMMARY: NESTED | FIELD | CONSTR | METHOD | DETAIL: FIELD | CONSTR | METHOD