Java DirectedSparseMultigraph.getEdges方法代码示例

import edu.uci.ics.jung.graph.DirectedSparseMultigraph; //导入方法依赖的package包/类
public UnosData(
    ImmutableSet<UnosExchangeUnit> altruisticDonors,
    ImmutableSet<UnosExchangeUnit> pairs,
    DirectedSparseMultigraph<UnosExchangeUnit, UnosDonorEdge> feasibleTransplants) {
  super();
  this.altruisticDonors = altruisticDonors;
  this.pairs = pairs;
  this.feasibleTransplants = feasibleTransplants;
  ImmutableBiMap.Builder<String, UnosExchangeUnit> nodeIdBuilder = ImmutableBiMap
      .builder();
  for (UnosExchangeUnit alt : altruisticDonors) {
    nodeIdBuilder.put("a" + alt.getDonors().get(0).getId(), alt);
  }
  for (UnosExchangeUnit paired : pairs) {
    nodeIdBuilder.put("p" + paired.getPatient().getId(), paired);
  }
  this.nodeIds = nodeIdBuilder.build();
  ImmutableBiMap.Builder<String, UnosDonorEdge> edgeIdBuilder = ImmutableBiMap
      .builder();
  for (UnosDonorEdge edge : feasibleTransplants.getEdges()) {
    String id = "e" + edge.getDonor().getId() + "-"
        + feasibleTransplants.getDest(edge).getPatient().getId();
    edgeIdBuilder.put(id, edge);
  }
  this.edgeIds = edgeIdBuilder.build();
}
 

import edu.uci.ics.jung.graph.DirectedSparseMultigraph; //导入方法依赖的package包/类
public GraphPanel(DirectedSparseMultigraph<V, E> graph) {
  // this.setLayout(new FlowLayout());
  DirectedSparseMultigraph<V, E> graphTemp = new DirectedSparseMultigraph<V, E>();
  for (V vertex : graph.getVertices()) {
    if (graph.inDegree(vertex) > 0 || graph.outDegree(vertex) > 0) {
      graphTemp.addVertex(vertex);
    }
  }
  for (E edge : graph.getEdges()) {
    if (graphTemp.containsVertex(graph.getSource(edge))
        && graphTemp.containsVertex(graph.getDest(edge))) {
      graphTemp.addEdge(edge, graph.getSource(edge), graph.getDest(edge));
    }
  }
  this.graph = graphTemp;
  layout = new KKLayout<V, E>(this.graph);
  layout.setSize(new Dimension(1000, 800)); // sets the initial size of the
                                            // space
  // The BasicVisualizationServer<V,E> is parameterized by the edge types
  BasicVisualizationServer<V, E> server = new BasicVisualizationServer<V, E>(
      layout);
  server.setPreferredSize(new Dimension(1000, 800));
  this.add(server);

}
 

import edu.uci.ics.jung.graph.DirectedSparseMultigraph; //导入方法依赖的package包/类
public static <V, E, T extends Comparable<T>> ImmutableMap<E, TimeInstant<T>> inferEdgeArrivalTimes(
    ImmutableMap<V, TimeInstant<T>> nodeArrivalTimes,
    DirectedSparseMultigraph<V, E> feasibleTransplants) {
  ImmutableMap.Builder<E, TimeInstant<T>> edgeArrivalTimes = ImmutableMap
      .builder();
  for (E edge : feasibleTransplants.getEdges()) {
    try {
      TimeInstant<T> sourceTime = nodeArrivalTimes.get(feasibleTransplants
          .getSource(edge));
      TimeInstant<T> destTime = nodeArrivalTimes.get(feasibleTransplants
          .getDest(edge));
      if (sourceTime.compareTo(destTime) <= 0) {
        edgeArrivalTimes.put(edge, destTime);
      } else {
        edgeArrivalTimes.put(edge, sourceTime);
      }
    } catch (RuntimeException e) {
      System.out.println("edge: " + edge);
      System.out.println("source: " + feasibleTransplants.getSource(edge));
      System.out.println("sink: " + feasibleTransplants.getDest(edge));
      System.out.println(nodeArrivalTimes);
      throw e;
    }
  }
  return edgeArrivalTimes.build();
}
 

import edu.uci.ics.jung.graph.DirectedSparseMultigraph; //导入方法依赖的package包/类
public DirectedEdgeVariables(DirectedSparseMultigraph<V,E> graph, IloCplex cplex) throws IloException{
	super(new HashSet<E>(graph.getEdges()),cplex);
	this.graph = graph;
}
 

import edu.uci.ics.jung.graph.DirectedSparseMultigraph; //导入方法依赖的package包/类
public String cohesionGroup(ArrayList<String> actors, MultiMap interactions){
	
	DirectedSparseMultigraph<String, String> graph = this.generateGhaph(actors, interactions);
	
	Collection<String> edges = graph.getEdges();
	
	double numArcs = (double)edges.size();
	
	double numActors = (double)actors.size();
	
	double density = (numArcs / (numActors * (numActors - 1)));
	
	Double density1 = new Double(density);
	
	double p = Math.pow(10, 4);  
	
	Double densityFormated = Math.round(density1 * p) / p;
	
	// Save graph
	
	this.saveGraph(graph);
	
	return this.reportCohesion(densityFormated.toString());
	
}