src/main/java/org/jboss/util/graph/Vertex.java
public Edge<T> findEdge(Vertex<T> dest)
   {
      for (Edge<T> e : outgoingEdges)
      {
         if (e.getTo() == dest)
            return e;
      }
      return null;
   }
public Edge<T> findEdge(Vertex<T> dest)
   {
      for (Edge<T> e : outgoingEdges)
      {
         if (e.getTo() == dest)
            return e;
      }
      return null;
   }
public Edge < T > findEdge ( Vertex < T > dest ) { for ( Edge < T > e : outgoingEdges ) { if ( e . getTo ( ) == dest ) return e ; } return null ; }
Search the outgoing edges looking for an edge whose's
edge.to == dest.
@param dest the destination
@return the outgoing edge going to dest if one exists,
null otherwise.
Search the outgoing edges looking for an edge whose s edge . to == dest .