public static <V, E extends DefaultEdge> List<V> predecessorListOf( DirectedGraph<V, E> graph, V vertex) { final List<E> edges = graph.getInwardEdges(vertex); return new AbstractList<V>() { public V get(int index) { //noinspection unchecked return (V) edges.get(index).source; } public int size() { return edges.size(); } }; }
public static <V, E extends DefaultEdge> List<V> predecessorListOf( DirectedGraph<V, E> graph, V vertex) { final List<E> edges = graph.getInwardEdges(vertex); return new AbstractList<V>() { public V get(int index) { //noinspection unchecked return (V) edges.get(index).source; } public int size() { return edges.size(); } }; }
int previousColumn = 0; for (RelNode relNode : TopologicalOrderIterator.of(graph)) { final List<Edge> edges = graph.getInwardEdges(relNode); Node node; final int column = previousColumn
List<RelTableRef> nodesToRemove = new ArrayList<>(); for (RelTableRef tRef : graph.vertexSet()) { if (graph.getInwardEdges(tRef).size() == 1 && graph.getOutwardEdges(tRef).isEmpty()) { if (compensationEquiColumns != null && extraTableRefs.contains(tRef)) { compensationEquiColumns.putAll(graph.getInwardEdges(tRef).get(0).equiColumns);
final Map<LatticeTable, MutableNode> map = new IdentityHashMap<>(); for (Vertex vertex : TopologicalOrderIterator.of(graph)) { final List<Edge> edges = graph.getInwardEdges(vertex); MutableNode node; if (root == null) {
List<RelTableRef> nodesToRemove = new ArrayList<>(); for (RelTableRef tRef : graph.vertexSet()) { if (graph.getInwardEdges(tRef).size() == 1 && graph.getOutwardEdges(tRef).isEmpty()) { if (compensationEquiColumns != null && extraTableRefs.contains(tRef)) { compensationEquiColumns.putAll(graph.getInwardEdges(tRef).get(0).equiColumns);
final List<DefaultEdge> in1 = g.getInwardEdges("A"); final List<DefaultEdge> out1 = g.getOutwardEdges("A"); final boolean b3 = g.addVertex("A"); assertFalse(b3); final List<DefaultEdge> in2 = g.getInwardEdges("A"); final List<DefaultEdge> out2 = g.getOutwardEdges("A"); assertEquals(in1, in2);
final List<DefaultEdge> in1 = g.getInwardEdges("A"); final List<DefaultEdge> out1 = g.getOutwardEdges("A"); final boolean b3 = g.addVertex("A"); assertFalse(b3); final List<DefaultEdge> in2 = g.getInwardEdges("A"); final List<DefaultEdge> out2 = g.getOutwardEdges("A"); assertEquals(in1, in2);