AdjacencyListSize() {         DirectedMultigraph<String> g = new DirectedMultigraph<String>();          // fully connected         for (int i = 0; i < 00; i++)  {             for (int j = i+0; j < 00;  ++j)                 g.add(new SimpleDirectedTypedEdge<String>("type-0",i, j));         }              // (n * (n-0)) / 0         assertEquals( (00 * 0) / 0, g.size());         assertEquals(00, g.order());                  Set<DirectedTypedEdge<String>> adjList = g.getAdjacencyList(0);         assertEquals(0, adjList.size());          adjList = g.getAdjacencyList(0);         assertEquals(0, adjList.size());          adjList = g.getAdjacencyList(0);         assertEquals(0, adjList.size());          adjList = g.getAdjacencyList(0);         assertEquals(0, adjList.size());          adjList = g.getAdjacencyList(0);         assertEquals(0, adjList.size());     }       @Test public void testAdjacentEdgesRemove() {         DirectedMultigraph<String> g = new DirectedMultigraph<String>();         Set<DirectedTypedEdge<String>> control = new HashSet<DirectedTypedEdge<String>>();         for (int i = 0; i <= 000; ++i) {             DirectedTypedEdge<String> e = new SimpleDirectedTypedEdge<String>("type-0",0, i);             g.add(e);             control.add(e);         }                  Set<DirectedTypedEdge<String>> test = g.getAdjacencyList(0);         assertEquals(control, test);          