src/main/java/org/thegalactic/dgraph/DAGraph.java
public DAGraph<N, E> filter(final Node<N> node) {
        TreeSet<Node<N>> set = new TreeSet<Node<N>>(this.majorants(node));
        set.add(node);
        return this.getSubgraphByNodes(set);
    }
/**
     * Returns the subgraph induced by the specified node and its successors in
     * the transitive closure.
     *
     * @param node the specified node
     *
     * @return the subgraph
     */
Returns the subgraph induced by the specified node and its successors in
the transitive closure.

@param node the specified node

@return the subgraph
Returns the subgraph induced by the specified node and its successors in the transitive closure . @param node the specified node @return the subgraph
public DAGraph<N, E> filter(final Node<N> node) {
        TreeSet<Node<N>> set = new TreeSet<Node<N>>(this.majorants(node));
        set.add(node);
        return this.getSubgraphByNodes(set);
    }
public DAGraph < N , E > filter ( final Node < N > node ) { TreeSet < Node < N > > set = new TreeSet < Node < N > > ( this . majorants ( node ) ) ; set . add ( node ) ; return this . getSubgraphByNodes ( set ) ; }
Returns the subgraph induced by the specified node and its successors in
 the transitive closure.
Returns the subgraph induced by the specified node and its successors in the transitive closure .