public static Graph createMultiGraph(String name, String style) { Graph g = new MultiGraph(name); g.addAttribute("ui.quality"); g.addAttribute("ui.antialias"); g.addAttribute("ui.stylesheet", style); return g; }
/** * This implementation uses {@link #getEdgeToward(Node)} * * @see org.graphstream.graph.Node#getEdgeToward(int) */ public <T extends Edge> T getEdgeToward(int index) { return getEdgeToward(graph.getNode(index)); }
/** * This implementation uses {@link #getEdgeFrom(Node)} * * @see org.graphstream.graph.Node#getEdgeFrom(java.lang.String) */ public <T extends Edge> T getEdgeFrom(String id) { return getEdgeFrom(graph.getNode(id)); }
@Override protected void removeEdge(int i) { AbstractNode opposite = edges[i].getOpposite(this); TwoEdges ee = neighborMap.get(opposite); char type = edgeType(edges[i]); if (type != O_EDGE) ee.in = null; if (type != I_EDGE) ee.out = null; if (ee.in == null && ee.out == null) neighborMap.remove(opposite); super.removeEdge(i); }
/** * This implementation uses {@link #getEdgeBetween(Node)} * * @see org.graphstream.graph.Node#getEdgeBetween(java.lang.String) */ public <T extends Edge> T getEdgeBetween(String id) { return getEdgeBetween(graph.getNode(id)); }
public <T extends Edge> Collection<T> getEdgeSetBetween(int index) { return getEdgeSetBetween(graph.getNode(index)); } }
/** * This implementation returns {@code true} if {@link #getEdgeFrom(int)} is * not {@code null}. * * @see org.graphstream.graph.Node#hasEdgeFrom(int) */ public boolean hasEdgeFrom(int index) { return getEdgeFrom(index) != null; }
public AlgorithmEventsRecorder(VehicleRoutingProblem vrp, String dgsFileLocation) { this.vrp = vrp; graph = new MultiGraph("g"); try { File dgsFile = new File(dgsFileLocation); fos = new FileOutputStream(dgsFile); fileSink = new FileSinkDGS(); if (dgsFile.getName().endsWith("gz")) { gzipOs = new GZIPOutputStream(fos); fileSink.begin(gzipOs); } else { fileSink.begin(fos); } graph.addSink(fileSink); } catch (IOException e) { e.printStackTrace(); } initialiseGraph(vrp); }
/** * This implementation uses {@link #getEdgeToward(Node)} * * @see org.graphstream.graph.Node#getEdgeToward(java.lang.String) */ public <T extends Edge> T getEdgeToward(String id) { return getEdgeToward(graph.getNode(id)); }
/** * This implementation uses {@link #getEdgeFrom(Node)} * * @see org.graphstream.graph.Node#getEdgeFrom(int) */ public <T extends Edge> T getEdgeFrom(int index) { return getEdgeFrom(graph.getNode(index)); }
/** * This implementation uses {@link #getEdgeBetween(Node)} * * @see org.graphstream.graph.Node#getEdgeBetween(int) */ public <T extends Edge> T getEdgeBetween(int index) { return getEdgeBetween(graph.getNode(index)); }
public <T extends Edge> Collection<T> getEdgeSetBetween(int index) { return getEdgeSetBetween(graph.getNode(index)); } }
/** * This implementation uses {@link #getEdgeToward(Node)} * * @see org.graphstream.graph.Node#getEdgeToward(int) */ public <T extends Edge> T getEdgeToward(int index) { return getEdgeToward(graph.getNode(index)); }
/** * This implementation uses {@link #getEdgeFrom(Node)} * * @see org.graphstream.graph.Node#getEdgeFrom(int) */ public <T extends Edge> T getEdgeFrom(int index) { return getEdgeFrom(graph.getNode(index)); }
/** * This implementation uses {@link #getEdgeBetween(Node)} * * @see org.graphstream.graph.Node#getEdgeBetween(java.lang.String) */ public <T extends Edge> T getEdgeBetween(String id) { return getEdgeBetween(graph.getNode(id)); }
public <T extends Edge> Collection<T> getEdgeSetBetween(String id) { return getEdgeSetBetween(graph.getNode(id)); }
/** * This implementation uses {@link #getEdgeToward(Node)} * * @see org.graphstream.graph.Node#getEdgeToward(java.lang.String) */ public <T extends Edge> T getEdgeToward(String id) { return getEdgeToward(graph.getNode(id)); }
/** * This implementation uses {@link #getEdgeFrom(Node)} * * @see org.graphstream.graph.Node#getEdgeFrom(java.lang.String) */ public <T extends Edge> T getEdgeFrom(String id) { return getEdgeFrom(graph.getNode(id)); }
/** * This implementation uses {@link #getEdgeBetween(Node)} * * @see org.graphstream.graph.Node#getEdgeBetween(int) */ public <T extends Edge> T getEdgeBetween(int index) { return getEdgeBetween(graph.getNode(index)); }
public <T extends Edge> Collection<T> getEdgeSetBetween(String id) { return getEdgeSetBetween(graph.getNode(id)); }