src/main/java/com/infilos/DAGraph.java
/**
     * @return all the edges without meta info
     */
@return all the edges without meta info
@return all the edges without meta info
public Map<Node, Set<Node>> allEdges() {
        lock.readLock().lock();
        try {
            Map<Node, Set<Node>> edges = new HashMap<>();
            for (Map.Entry<Node, Map<Node, EdgeMeta>> entry : forwardEdges.entrySet()) {
                edges.put(entry.getKey(), entry.getValue().keySet());
            }
            return edges;
        } finally {
            lock.readLock().unlock();
        }
    }
public Map < Node , Set < Node > > allEdges ( ) { lock . readLock ( ) . lock ( ) ; try { Map < Node , Set < Node > > edges = new HashMap < > ( ) ; for ( Map . Entry < Node , Map < Node , EdgeMeta > > entry : forwardEdges . entrySet ( ) ) { edges . put ( entry . getKey ( ) , entry . getValue ( ) . keySet ( ) ) ; } return edges ; } finally { lock . readLock ( ) . unlock ( ) ; } }
@return all the edges without meta info
@return all the edges without meta info