@Test public void nodeOrderUnorderedandEdgesSorted() { MutableNetwork<Integer, String> network = NetworkBuilder.directed() .nodeOrder(unordered()) .edgeOrder(ElementOrder.sorted(Ordering.<String>natural().reverse())) .build(); addEdges(network); assertThat(network.edgeOrder()) .isEqualTo(ElementOrder.sorted(Ordering.<String>natural().reverse())); assertThat(network.edges()).containsExactly("p", "i", "e").inOrder(); assertThat(network.nodeOrder()).isEqualTo(unordered()); assertThat(network.nodes()).containsExactly(4, 1, 3); }
public SampleGraph(final Method m, final SampleNode node) { int nrNodes = node.getNrNodes(); vertexMap = MultimapBuilder.hashKeys(nrNodes).hashSetValues(1).build(); aggregates = new THashMap<>(nrNodes); sampleTree = GraphBuilder.directed() .nodeOrder(ElementOrder.unordered()) .allowsSelfLoops(false) .expectedNodeCount(nrNodes) .build(); aggGraph = GraphBuilder.directed() .nodeOrder(ElementOrder.unordered()) .allowsSelfLoops(false) .expectedNodeCount(nrNodes) .build(); rootVertex = tree2Graph(m, node); }
@Test public void nodeOrderUnorderedandEdgesSorted() { MutableNetwork<Integer, String> network = NetworkBuilder.directed() .nodeOrder(unordered()) .edgeOrder(ElementOrder.sorted(Ordering.<String>natural().reverse())) .build(); addEdges(network); assertThat(network.edgeOrder()) .isEqualTo(ElementOrder.sorted(Ordering.<String>natural().reverse())); assertThat(network.edges()).containsExactly("p", "i", "e").inOrder(); assertThat(network.nodeOrder()).isEqualTo(unordered()); assertThat(network.nodes()).containsExactly(4, 1, 3); }
@Test public void equivalent_propertiesDiffer() { MutableCTree<Integer> t1 = TreeBuilder.builder().nodeOrder(ElementOrder.insertion()).build(); t1.putEdge(N1, N2); MutableCTree<Integer> t2 = TreeBuilder.from(t1).nodeOrder(ElementOrder.unordered()).build(); t2.putEdge(N1, N2); assertThat(t1).isEqualTo(t2); }