src/main/java/org/thegalactic/dgraph/DAGraph.java
public SortedSet<Node<N>> minorants(final Node<N> node) {
        DAGraph graph = new DAGraph(this);
        graph.transitiveClosure();
        return graph.getPredecessorNodes(node);
    }
/**
     * Returns the set of minorants of the specified node.
     *
     * Minorants of a node are its predecessors in the transitive closure
     *
     * @param node the specified node
     *
     * @return the set of minorants
     */
Returns the set of minorants of the specified node.
Minorants of a node are its predecessors in the transitive closure

@param node the specified node

@return the set of minorants
Returns the set of minorants of the specified node . Minorants of a node are its predecessors in the transitive closure @param node the specified node @return the set of minorants
public SortedSet<Node<N>> minorants(final Node<N> node) {
        DAGraph graph = new DAGraph(this);
        graph.transitiveClosure();
        return graph.getPredecessorNodes(node);
    }
public SortedSet < Node < N > > minorants ( final Node < N > node ) { DAGraph graph = new DAGraph ( this ) ; graph . transitiveClosure ( ) ; return graph . getPredecessorNodes ( node ) ; }
Returns the set of minorants of the specified node.
Returns the set of minorants of the specified node .