src/main/java/de/dfki/lt/loot/digraph/DiGraph.java
public Edge<EI> newEdge(EI edgeInfo, int from, int to) {
    assert(isVertex(from) && isVertex(to));
    Edge<EI> edge = new Edge<EI>(edgeInfo, from, to);
    setFrom(edge, from);
    setTo(edge, to);
    return edge;
  }
/**
   * This creates a new edge with the given edge info and returns it. The edge
   * is part of this directed graph.
   *
   * The implementation of the edge containers (_inEdges and _outEdges)
   * determines if the graph may have multiple edges with the same source and
   * target (and info ...)
   *
   * @param edgeInfo  a <code>EdgeInfo</code> with the info assigned to the
   *                  newly cerated edge
   * @param from      the start vertex of the edge, which must be a valid
   *                  vertex of the graph
   * @param to        the end vertex of the edge, which must be a valid
   *                  vertex of the graph
   * @return a newly created {@link Edge}
   */
This creates a new edge with the given edge info and returns it. The edge
is part of this directed graph.

The implementation of the edge containers (_inEdges and _outEdges)
determines if the graph may have multiple edges with the same source and
target (and info ...)

@param edgeInfo  a EdgeInfo with the info assigned to the
newly cerated edge
@param from      the start vertex of the edge, which must be a valid
vertex of the graph
@param to        the end vertex of the edge, which must be a valid
vertex of the graph
@return a newly created  Edge
This creates a new edge with the given edge info and returns it . The edge is part of this directed graph . The implementation of the edge containers ( _inEdges and _outEdges ) determines if the graph may have multiple edges with the same source and target ( and info ... ) @param edgeInfo a EdgeInfo with the info assigned to the newly cerated edge @param from the start vertex of the edge which must be a valid vertex of the graph @param to the end vertex of the edge which must be a valid vertex of the graph @return a newly created Edge
public Edge<EI> newEdge(EI edgeInfo, int from, int to) {
    assert(isVertex(from) && isVertex(to));
    Edge<EI> edge = new Edge<EI>(edgeInfo, from, to);
    setFrom(edge, from);
    setTo(edge, to);
    return edge;
  }
public Edge < EI > newEdge ( EI edgeInfo , int from , int to ) { assert ( isVertex ( from ) && isVertex ( to ) ) ; Edge < EI > edge = new Edge < EI > ( edgeInfo , from , to ) ; setFrom ( edge , from ) ; setTo ( edge , to ) ; return edge ; }
This creates a new edge with the given edge info and returns it.
This creates a new edge with the given edge info and returns it .