src/main/java/org/thegalactic/dgraph/ConcreteDGraph.java
public boolean containsEdge(final Node<N> source, final Node<N> target) {
        return this.containsNode(source)
                && this.containsNode(target)
                && this.getSuccessorNodes(source).contains(target)
                && this.getPredecessorNodes(target).contains(source);
    }
/**
     * Checks if there exists an edge between the two specified nodes.
     *
     * @param source the node origine of the edge
     * @param target the node destination of the edge
     *
     * @return true if the edge is contained by this component
     */
Checks if there exists an edge between the two specified nodes.
@param source the node origine of the edge
@param target the node destination of the edge

@return true if the edge is contained by this component
Checks if there exists an edge between the two specified nodes . @param source the node origine of the edge @param target the node destination of the edge @return true if the edge is contained by this component
public boolean containsEdge(final Node<N> source, final Node<N> target) {
        return this.containsNode(source)
                && this.containsNode(target)
                && this.getSuccessorNodes(source).contains(target)
                && this.getPredecessorNodes(target).contains(source);
    }
public boolean containsEdge ( final Node < N > source , final Node < N > target ) { return this . containsNode ( source ) && this . containsNode ( target ) && this . getSuccessorNodes ( source ) . contains ( target ) && this . getPredecessorNodes ( target ) . contains ( source ) ; }
Checks if there exists an edge between the two specified nodes.
Checks if there exists an edge between the two specified nodes .