public StitchPort buildStitchPort(String name, String label, String port, long bandwidth){ StitchPort node = new StitchPort(this,name,label,port,bandwidth); sliceGraph.addVertex(node); return node; } public BroadcastNetwork buildLink(String name){
public BroadcastNetwork buildLink(String name){ BroadcastNetwork link = new BroadcastNetwork(this,name); sliceGraph.addVertex(link); return link; } public BroadcastNetwork buildBroadcastLink(String name){
public BroadcastNetwork buildBroadcastLink(String name){ BroadcastNetwork link = new BroadcastNetwork(this,name); sliceGraph.addVertex(link); return link; }
/************ Build resources in jung model without adding to ndlmodel **********/ public ComputeNode buildComputeNode(String name){ LIBNDL.logger().debug("PRUTH_BUILD: SliceGraph.buildComputeNode: adding node " + name); ComputeNode node = new ComputeNode(this,name); sliceGraph.addVertex(node); return node; } public StorageNode buildStorageNode(String name){
public StorageNode buildStorageNode(String name){ LIBNDL.logger().debug("PRUTH_BUILD: SliceGraph.buildStorageNode: adding node " + name); StorageNode node = new StorageNode(this,name); sliceGraph.addVertex(node); return node; } public StitchPort buildStitchPort(String name, String label, String port, long bandwidth){
@Override public boolean addEdge(E edge, Pair<? extends V> endpoints, EdgeType edgeType) { Pair<V> new_endpoints = getValidatedEndpoints(edge, endpoints); if (new_endpoints == null) return false; V v1 = new_endpoints.getFirst(); V v2 = new_endpoints.getSecond(); if (!vertices.containsKey(v1)) this.addVertex(v1); if (!vertices.containsKey(v2)) this.addVertex(v2); vertices.get(v1).getSecond().add(edge); vertices.get(v2).getFirst().add(edge); edges.put(edge, new_endpoints); if(edgeType == EdgeType.DIRECTED) { directedEdges.add(edge); } else { vertices.get(v1).getFirst().add(edge); vertices.get(v2).getSecond().add(edge); } return true; }
@Override public boolean addEdge(E edge, Pair<? extends V> endpoints, EdgeType edgeType) { Pair<V> new_endpoints = getValidatedEndpoints(edge, endpoints); if (new_endpoints == null) { return false; } V v1 = new_endpoints.getFirst(); V v2 = new_endpoints.getSecond(); if (!vertices.containsKey(v1)) { this.addVertex(v1); } if (!vertices.containsKey(v2)) { this.addVertex(v2); } vertices.get(v1).getSecond().add(edge); vertices.get(v2).getFirst().add(edge); edges.put(edge, new_endpoints); if (edgeType == EdgeType.DIRECTED) { directedEdges.add(edge); } else { vertices.get(v1).getFirst().add(edge); vertices.get(v2).getSecond().add(edge); } return true; }
private static Hypergraph<ElementName, Integer> makeNonDirectional( final DirectedGraph<ElementName, Integer> packageNameGraph) { final SparseMultigraph<ElementName, Integer> g = new SparseMultigraph<ElementName, Integer>(); int i = 0; for (final ElementName each : packageNameGraph.getVertices()) { g.addVertex(each); for (final ElementName s : packageNameGraph.getSuccessors(each)) { g.addEdge(i, each, s); i++; } } return g; }
private static Hypergraph<ElementName, Integer> makeNonDirectional( final DirectedGraph<ElementName, Integer> packageNameGraph) { final SparseMultigraph<ElementName, Integer> g = new SparseMultigraph<ElementName, Integer>(); int i = 0; for (final ElementName each : packageNameGraph.getVertices()) { g.addVertex(each); for (final ElementName s : packageNameGraph.getSuccessors(each)) { g.addEdge(i, each, s); i++; } } return g; }
private static Hypergraph<ElementName, Integer> makeNonDirectional( final DirectedGraph<ElementName, Integer> packageNameGraph) { final SparseMultigraph<ElementName, Integer> g = new SparseMultigraph<ElementName, Integer>(); int i = 0; for (final ElementName each : packageNameGraph.getVertices()) { g.addVertex(each); for (final ElementName s : packageNameGraph.getSuccessors(each)) { g.addEdge(i, each, s); i++; } } return g; }