src/main/java/org/thegalactic/lattice/ConceptLattice.java
public boolean makeEdgeValuation() {
        if (!this.containsConcepts()) {
            return false;
        }
        for (Object n1 : this.getNodes()) {
            for (Object ed : this.getSuccessorEdges((Node) n1)) {
                if (!((Edge) ed).hasContent()) {
                    Node n2 = ((Edge) ed).getTarget();
                    TreeSet diff = new TreeSet();
                    diff.addAll(((Concept) n2).getSetA());
                    diff.removeAll(((Concept) n1).getSetA());
                    ((Edge) ed).setContent(diff);
                }
            }
        }
        return true;
    }
/**
     * Returns a lattice where edges are valuated by the difference between set
     * A of two adjacent concepts.
     *
     * @return a boolean
     *
     * @todo Change comment
     */
Returns a lattice where edges are valuated by the difference between set
A of two adjacent concepts.

@return a boolean

@todo Change comment
Returns a lattice where edges are valuated by the difference between set A of two adjacent concepts . @return a boolean @todo Change comment
public boolean makeEdgeValuation() {
        if (!this.containsConcepts()) {
            return false;
        }
        for (Object n1 : this.getNodes()) {
            for (Object ed : this.getSuccessorEdges((Node) n1)) {
                if (!((Edge) ed).hasContent()) {
                    Node n2 = ((Edge) ed).getTarget();
                    TreeSet diff = new TreeSet();
                    diff.addAll(((Concept) n2).getSetA());
                    diff.removeAll(((Concept) n1).getSetA());
                    ((Edge) ed).setContent(diff);
                }
            }
        }
        return true;
    }
public boolean makeEdgeValuation ( ) { if ( ! this . containsConcepts ( ) ) { return false ; } for ( Object n1 : this . getNodes ( ) ) { for ( Object ed : this . getSuccessorEdges ( ( Node ) n1 ) ) { if ( ! ( ( Edge ) ed ) . hasContent ( ) ) { Node n2 = ( ( Edge ) ed ) . getTarget ( ) ; TreeSet diff = new TreeSet ( ) ; diff . addAll ( ( ( Concept ) n2 ) . getSetA ( ) ) ; diff . removeAll ( ( ( Concept ) n1 ) . getSetA ( ) ) ; ( ( Edge ) ed ) . setContent ( diff ) ; } } } return true ; }
Returns a lattice where edges are valuated by the difference between set
 A of two adjacent concepts.
Returns a lattice where edges are valuated by the difference between set A of two adjacent concepts .