src/main/java/com/infilos/DAGraph.java
/**
     * whether this edge is contained
     *
     * @param source node of edge
     * @param target node of edge
     *
     * @return true if contains
     */
whether this edge is contained
@param source node of edge
@param target node of edge

@return true if contains
whether this edge is contained @param source node of edge @param target node of edge @return true if contains
public boolean containsEdge(Node source, Node target) {
        lock.readLock().lock();
        try {
            Map<Node, EdgeMeta> outEdges = forwardEdges.get(source);
            return outEdges!=null && outEdges.containsKey(target);
        } finally {
            lock.readLock().unlock();
        }
    }
public boolean containsEdge ( Node source , Node target ) { lock . readLock ( ) . lock ( ) ; try { Map < Node , EdgeMeta > outEdges = forwardEdges . get ( source ) ; return outEdges != null && outEdges . containsKey ( target ) ; } finally { lock . readLock ( ) . unlock ( ) ; } }
whether this edge is contained
 @param source node of edge
 @param target node of edge
whether this edge is contained @param source node of edge @param target node of edge