Documentation of 'edu.uci.ics.jung.algorithms.util.SelfLoopEdgePredicate' Java class
SelfLoopEdgePredicate
edu.uci.ics.jung.algorithms.util

Class 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 java.lang.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).
    • Method Summary

      All Methods Instance Methods Concrete Methods 
      Modifier and Type Method and Description
      boolean apply(Context<Graph<V,E>,E> context) 
      • Methods inherited from class java.lang.Object

        equals, 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>>

DataMelt 3.0 © DataMelt by jWork.ORG

You see the box below because you did not login.