src/main/java/de/dfki/lt/loot/digraph/DiGraph.java
public Edge<EI> findEdge(
      int vertex,
      EI anEdgeInfo,
      Comparator<EI> comp) {

    for (Edge<EI> edge : getOutEdges(vertex)) {
      if (comp.compare(edge.getInfo(), anEdgeInfo) == 0) {
        return edge;
      }
    }
    return null;
  }
/**
   * This returns the first edge emerging from vertex where the edge info is
   * compatible to the given edge info according to the given predicate.
   *
   * @param anEdgeInfo the <code>EdgeInfo</code> for which to find matching
   * edges
   * @param binPred a {@link BinaryPredicate} used to compare the edge infos
   * @return an {@link Edge}s that matches or <code>null</code>
   */
This returns the first edge emerging from vertex where the edge info is
compatible to the given edge info according to the given predicate.

@param anEdgeInfo the EdgeInfo for which to find matching
edges
@param binPred a  BinaryPredicate used to compare the edge infos
@return an  Edges that matches or null
This returns the first edge emerging from vertex where the edge info is compatible to the given edge info according to the given predicate . @param anEdgeInfo the EdgeInfo for which to find matching edges @param binPred a BinaryPredicate used to compare the edge infos @return an Edges that matches or null
public Edge<EI> findEdge(
      int vertex,
      EI anEdgeInfo,
      Comparator<EI> comp) {
    for (Edge<EI> edge : getOutEdges(vertex)) {
      if (comp.compare(edge.getInfo(), anEdgeInfo) == 0) {
        return edge;
      }
    }
    return null;
  }
public Edge < EI > findEdge ( int vertex , EI anEdgeInfo , Comparator < EI > comp ) { for ( Edge < EI > edge : getOutEdges ( vertex ) ) { if ( comp . compare ( edge . getInfo ( ) , anEdgeInfo ) == 0 ) { return edge ; } } return null ; }
This returns the first edge emerging from vertex where the edge info is
 compatible to the given edge info according to the given predicate.
This returns the first edge emerging from vertex where the edge info is compatible to the given edge info according to the given predicate .