ar() {         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());          g.clear();         assertEquals(0, g.size());         assertEquals(0, g.order());         assertEquals(0, g.vertices().size());         assertEquals(0, g.edges().size());                  // Error checking case for double-clear         g.clear