public boolean addVertex(V vertex) { if(vertex == null) { throw new IllegalArgumentException("vertex may not be null"); } if (!vertices.containsKey(vertex)) { vertices.put(vertex, new Pair<Set<E>>(new HashSet<E>(), new HashSet<E>())); return true; } else { return false; } }
@Override public boolean addVertex(V vertex) { if (vertex == null) { throw new IllegalArgumentException("vertex may not be null"); } if (!vertices.containsKey(vertex)) { vertices.put(vertex, new Pair<Set<E>>(new HashSet<E>(), new HashSet<E>())); return true; } return false; }
@Override public boolean addVertex(V vertex) { if(vertex == null) { throw new IllegalArgumentException("vertex may not be null"); } if (!containsVertex(vertex)) { vertices.put(vertex, new Pair<Set<E>>(new LinkedHashSet<E>(), new LinkedHashSet<E>())); return true; } else { return false; } }
public boolean addVertex(V vertex) { if(vertex == null) { throw new IllegalArgumentException("vertex may not be null"); } if (!containsVertex(vertex)) { vertices.put(vertex, new Pair<Map<V,E>>(new HashMap<V,E>(), new HashMap<V,E>())); return true; } else { return false; } }
/** * Adds a directed edge to the graph. * * @param edge The edge. * @param v1 The first vertex. * @param v2 The second vertex. * @return <code>true</code> if success. */ public boolean addEdge(Object e, Object v1, Object v2) { return addEdge(e, new Pair(v1, v2)); }
@Override public boolean addVertex(V vertex) { if (vertex == null) { throw new IllegalArgumentException("vertex may not be null"); } if (!containsVertex(vertex)) { vertices.put(vertex, new Pair<Set<E>>(new LinkedHashSet<E>(), new LinkedHashSet<E>())); return true; } return false; }
@Override public boolean addVertex(V vertex) { if (vertex == null) { throw new IllegalArgumentException("vertex may not be null"); } if (!containsVertex(vertex)) { vertices.put(vertex, new Pair<Set<E>>(new LinkedHashSet<E>(), new LinkedHashSet<E>())); return true; } return false; }
@Override public boolean addVertex(V vertex) { if(vertex == null) { throw new IllegalArgumentException("vertex may not be null"); } if (!containsVertex(vertex)) { vertices.put(vertex, new Pair<Set<E>>(new LinkedHashSet<E>(), new LinkedHashSet<E>())); return true; } else { return false; } }
@Override public boolean addVertex(V vertex) { if (vertex == null) { throw new IllegalArgumentException("vertex may not be null"); } if (!containsVertex(vertex)) { vertices.put(vertex, new Pair<Set<E>>(new HashSet<E>(), new HashSet<E>())); return true; } return false; }
@Override public boolean addVertex(V vertex) { if (vertex == null) { throw new IllegalArgumentException("vertex may not be null"); } if (!containsVertex(vertex)) { vertices.put(vertex, new Pair<Map<V, E>>(new HashMap<V, E>(), new HashMap<V, E>())); return true; } return false; }
public boolean addVertex(V vertex) { if(vertex == null) { throw new IllegalArgumentException("vertex may not be null"); } if (!containsVertex(vertex)) { vertices.put(vertex, new Pair<Set<E>>(new HashSet<E>(), new HashSet<E>())); return true; } else { return false; } }
public boolean addEdge(E e, V v1, V v2, EdgeType edge_type) { return addEdge(e, new Pair<V>(v1, v2), edge_type); }
private void insertSourceLeaf(Node n, String[] words, int start, int end) { final String[] leafWords = Arrays.copyOfRange(words, start, end); String label = leafWords[0]; for (int i = 1; i < leafWords.length; i++) { label += " " + leafWords[i]; } Node childNode = new Node(label, true); addEdge(new DerivationTreeEdge(true), new Pair<>(n, childNode), EdgeType.DIRECTED); }
@SuppressWarnings("unchecked") @Override public boolean addEdge(E edge, Collection<? extends V> vertices) { Pair<V> pair = null; if (vertices instanceof Pair) { pair = (Pair<V>) vertices; } else { pair = new Pair<V>(vertices); } return addEdge(edge, pair.getFirst(), pair.getSecond()); }
@SuppressWarnings("unchecked") @Override public boolean addEdge(E edge, Collection<? extends V> vertices) { Pair<V> pair = null; if(vertices instanceof Pair) { pair = (Pair<V>)vertices; } else { pair = new Pair<V>(vertices); } return addEdge(edge, pair.getFirst(), pair.getSecond()); }
@SuppressWarnings("unchecked") @Override public boolean addEdge(E edge, Collection<? extends V> vertices) { Pair<V> pair = null; if (vertices instanceof Pair) { pair = (Pair<V>) vertices; } else { pair = new Pair<V>(vertices); } return addEdge(edge, pair.getFirst(), pair.getSecond()); }
@SuppressWarnings("unchecked") @Override public boolean addEdge(E edge, Collection<? extends V> vertices) { Pair<V> pair = null; if(vertices instanceof Pair) { pair = (Pair<V>)vertices; } else { pair = new Pair<V>(vertices); } return addEdge(edge, pair.getFirst(), pair.getSecond()); }
public void actionPerformed(ActionEvent e) { Collection picked = vv.getPickedVertexState().getPicked(); if(picked.size() == 2) { Pair pair = new Pair(picked); Graph graph = layout.getGraph(); Collection edges = new HashSet(graph.getIncidentEdges(pair.getFirst())); edges.retainAll(graph.getIncidentEdges(pair.getSecond())); exclusions.addAll(edges); vv.repaint(); } }});
public void actionPerformed(ActionEvent e) { Collection picked = vv.getPickedVertexState().getPicked(); if(picked.size() == 2) { Pair pair = new Pair(picked); Graph graph = layout.getGraph(); Collection edges = new HashSet(graph.getIncidentEdges(pair.getFirst())); edges.retainAll(graph.getIncidentEdges(pair.getSecond())); exclusions.removeAll(edges); vv.repaint(); } }});
private void addSubtreeRootedAt(Node n, Tree.Node tn) { for (Tree.Node child : tn.children()) { Node childNode = new Node(child.label(), false); addVertex(childNode); addEdge(new DerivationTreeEdge(false), new Pair<>(n, childNode), EdgeType.DIRECTED); addSubtreeRootedAt(childNode, child); } }