src/main/java/org/thegalactic/lattice/ClosureSystem.java
public ConceptLattice closedSetLattice(boolean diagram) {
        if (diagram) {
            return ConceptLattice.diagramLattice(this);
        } else {
            return ConceptLattice.completeLattice(this);
        }
    }
/**
     * Returns the closed set lattice of this component.
     *
     * A true value of the boolean `diagram` indicates that the Hasse diagramm
     * of the lattice is computed (i.e. it is transitively reduced), whereas a
     * false value indicates that the lattice is transitively closed
     *
     * A transitively reduced lattice is generated by the static method
     * `ConceptLattice diagramLattice (ClosureSystem init)` that implements an
     * adaptation of Bordat's algorithm. This adaptation computes the dependance
     * graph while the lattice is generated, with the same complexity.
     *
     * A transitively closed lattice is generated bye well-known Next Closure
     * algorithm. In this case, the dependance graph of the lattice isn't
     * computed.
     *
     * @param diagram a boolean indicating if the Hasse diagramm of the lattice
     *                is computed or not.
     *
     * @return The concept lattice
     */
Returns the closed set lattice of this component.
A true value of the boolean `diagram` indicates that the Hasse diagramm
of the lattice is computed , whereas a
false value indicates that the lattice is transitively closed

A transitively reduced lattice is generated by the static method
`ConceptLattice diagramLattice (ClosureSystem init)` that implements an
adaptation of Bordat's algorithm. This adaptation computes the dependance
graph while the lattice is generated, with the same complexity.

A transitively closed lattice is generated bye well-known Next Closure
algorithm. In this case, the dependance graph of the lattice isn't
computed.

@param diagram a boolean indicating if the Hasse diagramm of the lattice
is computed or not.

@return The concept lattice
Returns the closed set lattice of this component . A true value of the boolean ` diagram ` indicates that the Hasse diagramm of the lattice is computed whereas a false value indicates that the lattice is transitively closed A transitively reduced lattice is generated by the static method ` ConceptLattice diagramLattice ( ClosureSystem init ) ` that implements an adaptation of Bordat ' s algorithm . This adaptation computes the dependance graph while the lattice is generated with the same complexity . A transitively closed lattice is generated bye well - known Next Closure algorithm . In this case the dependance graph of the lattice isn ' t computed . @param diagram a boolean indicating if the Hasse diagramm of the lattice is computed or not . @return The concept lattice
public ConceptLattice closedSetLattice(boolean diagram) {
        if (diagram) {
            return ConceptLattice.diagramLattice(this);
        } else {
            return ConceptLattice.completeLattice(this);
        }
    }
public ConceptLattice closedSetLattice ( boolean diagram ) { if ( diagram ) { return ConceptLattice . diagramLattice ( this ) ; } else { return ConceptLattice . completeLattice ( this ) ; } }
Returns the closed set lattice of this component.
Returns the closed set lattice of this component .