/** * adds root as a root of the tree * @param root the initial tree root */ public void setRoot(V root) { delegate.addVertex(root); }
/** * @see edu.uci.ics.jung.graph.Hypergraph#addVertex(java.lang.Object) */ public boolean addVertex(V vertex) { return delegate.addVertex(vertex); }
/** * @see edu.uci.ics.jung.graph.Hypergraph#addVertex(java.lang.Object) */ public synchronized boolean addVertex(V vertex) { return delegate.addVertex(vertex); }
/** * @see edu.uci.ics.jung.graph.Hypergraph#addVertex(java.lang.Object) */ @Override public boolean addVertex(V vertex) { return delegate.addVertex(vertex); }
/** * adds root as a root of the tree * * @param root * the initial tree root */ public void setRoot(V root) { delegate.addVertex(root); }
/** * @see edu.uci.ics.jung.graph.Hypergraph#addVertex(java.lang.Object) */ @Override public synchronized boolean addVertex(V vertex) { return delegate.addVertex(vertex); }
public boolean addVertex(V vertex) { return graph.addVertex(vertex); } public boolean containsEdge(E edge) {
private void createVertice(Vertex v) { graph.addVertex(v); }
/** * create some vertices * @param count how many to create * @return the Vertices in an array */ private void createVertices() { for (String city : map.keySet()) { graph.addVertex(city); } }
/** * create some vertices * @param count how many to create * @return the Vertices in an array */ private Integer[] createVertices(int count) { Integer[] v = new Integer[count]; for (int i = 0; i < count; i++) { v[i] = new Integer(i); graph.addVertex(v[i]); } return v; }
/** * create some vertices * @param count how many to create * @return the Vertices in an array */ private Integer[] createVertices(int count) { Integer[] v = new Integer[count]; for (int i = 0; i < count; i++) { v[i] = new Integer(i); graph.addVertex(v[i]); } return v; }
/** * create some vertices * @param count how many to create * @return the Vertices in an array */ private Integer[] createVertices(int count) { Integer[] v = new Integer[count]; for (int i = 0; i < count; i++) { v[i] = new Integer(i); graph.addVertex(v[i]); } return v; }
private void initialize(Set<V> seedVertices) { mGraph = graphFactory.get(); vertex_index = new ArrayList<V>(2 * init_vertices); index_vertex = new HashMap<V, Integer>(2 * init_vertices); for (int i = 0; i < init_vertices; i++) { V v = vertexFactory.get(); mGraph.addVertex(v); vertex_index.add(v); index_vertex.put(v, i); seedVertices.add(v); } mElapsedTimeSteps = 0; }
/** * Adds a vertex to the graph. * @param vertex The vertex. * @return <code>true</code> if success. */ public boolean addVertex(Object vertex) { if (delegate.addVertex(vertex) == true) { internal_addVertex(vertex); return true; } else { return false; } }
private void initialize(Set<V> seedVertices) { mGraph = graphFactory.create(); vertex_index = new ArrayList<V>(2 * init_vertices); index_vertex = new HashMap<V, Integer>(2 * init_vertices); for (int i = 0; i < init_vertices; i++) { V v = vertexFactory.create(); mGraph.addVertex(v); vertex_index.add(v); index_vertex.put(v, i); seedVertices.add(v); } mElapsedTimeSteps = 0; }
private void initialize(Set<V> seedVertices) { mGraph = graphFactory.create(); vertex_index = new ArrayList<V>(2*init_vertices); index_vertex = new HashMap<V, Integer>(2*init_vertices); for (int i = 0; i < init_vertices; i++) { V v = vertexFactory.create(); mGraph.addVertex(v); vertex_index.add(v); index_vertex.put(v, i); seedVertices.add(v); } mElapsedTimeSteps = 0; }
private Graph<AnalysisEngine, Integer> createDependencyGraph( List<AnalysisEngine> analysisEngines) { Graph<AnalysisEngine, Integer> graph = new SparseMultigraph<>(); // First, add all annotators onto the graph for (AnalysisEngine ae : analysisEngines) graph.addVertex(ae); // Now add dependencies between annotators for (AnalysisEngine ae1 : analysisEngines) { for (AnalysisEngine ae2 : analysisEngines) { if (ae1 == ae2) continue; addAnnotatorDependencies(graph, ae1, ae2); } } return graph; }
public void actionPerformed(ActionEvent e) { V newVertex = vertexFactory.get(); graph.addVertex(newVertex); layout.setLocation(newVertex, vv.getRenderContext().getMultiLayerTransformer().inverseTransform(p)); vv.repaint(); } });
public void startVertexCreate(BasicVisualizationServer<V, E> vv, Point2D point) { V newVertex = vertexFactory.get(); Layout<V,E> layout = vv.getGraphLayout(); Graph<V,E> graph = layout.getGraph(); graph.addVertex(newVertex); layout.setLocation(newVertex, vv.getRenderContext().getMultiLayerTransformer().inverseTransform(point)); vv.repaint(); }
@Override public void rebuildGraph() { for (GUILink gl : new ArrayList<>(g.getEdges())) g.removeEdge(gl); for (GUINode gn : new ArrayList<>(g.getVertices())) g.removeVertex(gn); for (GUINode gn : callback.getVisualizationState().getCanvasAllGUINodes()) g.addVertex(gn); for (GUILink gl : callback.getVisualizationState().getCanvasAllGUILinks(true, true)) g.addEdge(gl, gl.getOriginNode(), gl.getDestinationNode()); updateAllVerticesXYPosition(); refresh(); }