Examples of org.jamesii.core.util.graph.EdgeInCut

org.jamesii.core.util.graph.EdgeInCut
Defines an edge in the cut of a partitioning. Consider the graph G=(V,E) with V=(v_1,v_2) and E={{v_1,v_2}}, i.e. this is a two-node graph with an edge between the two vertices. If a partitioning of this graph will assign v_1 to partition (block) 1 and v_2 to partition (block) 2, then e will be an edge in the cut. @author Roland Ewald


      if (parent == -1) {
        continue;
      }


      EdgeInCut cutEdge =
          new EdgeInCut(eqClassElem, parent, partition.get(eqClassElem),
              partition.get(parent));
      result.addEdge(new LabeledEdge<>(eqClassToNodeIndexMapping
          .get(eqClassElem), eqClassToNodeIndexMapping.get(getEquivalenceClass(
          parent, childRelations, partition)), cutEdge));
    }

View Full Code Here

TOP

Related Classes of org.jamesii.core.util.graph.EdgeInCut

org.jamesii.core.util.graph.tools.PartitioningUtilities

All source code are property of their respective owners. Java is a trademark of Sun Microsystems, Inc and owned by ORACLE Inc. Contact coftware#gmail.com.