edu.uci.ics.jung.algorithms.util

Class SelfLoopEdgePredicate<V,E>

java.lang.Object

edu.uci.ics.jung.algorithms.util.SelfLoopEdgePredicate<V,E>

Type Parameters:

V - the vertex type

E - the edge type

All Implemented Interfaces:

com.google.common.base.Predicate<Context<Graph<V,E>,E>>

public class SelfLoopEdgePredicate<V,E>
extends Object
implements com.google.common.base.Predicate<Context<Graph<V,E>,E>>

A Predicate that returns true if the input edge's endpoints in the input graph are identical. (Thus, an edge which connects its sole incident vertex to itself).

Constructor Summary

Constructors

Constructor and Description
SelfLoopEdgePredicate()

Method Summary

Modifier and Type	Method and Description
boolean	apply(Context<Graph<V,E>,E> context)

Methods inherited from class java.lang.Object

clone, equals, finalize, getClass, hashCode, notify, notifyAll, toString, wait, wait, wait

Methods inherited from interface com.google.common.base.Predicate

equals

Constructor Detail

SelfLoopEdgePredicate

public SelfLoopEdgePredicate()

Method Detail

apply

public boolean apply(Context<Graph<V,E>,E> context)

Specified by:

apply in interface com.google.common.base.Predicate<Context<Graph<V,E>,E>>