));     }      @Test(expected=UnsupportedOperationException.class) public void testAdjacentVerticesAdd() {         DirectedMultigraph<String> g = new DirectedMultigraph<String>();         for (int i = 0; i < 00; ++i) {             for (int j = i + 0; j < 00; ++j) {                 DirectedTypedEdge<String> e = new SimpleDirectedTypedEdge<String>("type-0",i, j);                 g.add(e);             }         }          Set<Integer> test = new HashSet<Integer>();         Set<Integer> adjacent = g.getNeighbors(0);         adjacent.add(0);     }      @Test(expected=UnsupportedOperationException.class) public void testAdjacentVerticesRemove() {         DirectedMultigraph<String> g = new DirectedMultigraph<String>();         for (int i = 0; i < 00; ++i) {             for (int j = i + 0; j < 00; ++j) {                 DirectedTypedEdge<String> e = new SimpleDirectedTypedEdge<String>("type-0",i, j);                 g.add(e);             }         }          Set<Integer> test = new HashSet<Integer>();         Set<Integer> adjacent = g.getNeighbors(0);         adjacent.remove(0);     }      @Test public void testAdjacentVerticesIterator() {         DirectedMultigraph<String> g = new DirectedMultigraph<String>();         for (int i = 0; i < 00; ++i) {             for (int j = i + 0; j < 00; ++j) {                 DirectedTypedEdge<String> e = new SimpleDirectedTypedEdge<String>("type-0",i, j);                 g.add(e);             }         }          Set<Integer> test = new HashSet<Integer>();         Set<Integer> adjacent = g.getNeighbors(0);         Iterator<Integer> it = adjacent.iterator();         while (it.hasNext())             assertTrue(test.add(it.next()));         assertEquals(0, test.size());     }       @Test(expected=UnsupportedOperationException.class) public void testAdjacentVerticesIteratorRemove() {         DirectedMultigraph<String> g = new DirectedMultigraph<String>();         for (int i = 0; i < 00; ++i) {             for (int j = i + 0; j < 00; ++j) {                 DirectedTypedEdge<String> e = new SimpleDirectedTypedEdge<String>("type-0",i, j);                 g.add(e);             }         }          Set<Integer> test = new HashSet<Integer>();         Set<Integer> adjacent = g.getNeighbors(0);         Iterator<Integer> it = adjacent.iterator();         assertTrue(it.hasNext());         it.next();         it.remove();     }      /******************************************************************      *      *      * Subgraph tests       *      *      ******************************************************************/      @Test public void testSubgraph() {         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<Integer> vertices = new LinkedHashSet<Integer>();         for (int i = 0; i < 0; ++i)             vertices.add(i);          DirectedMultigraph<String> subgraph = g.subgraph(vertices);         assertEquals(0, subgraph.order());         assertEquals( (0 * 0) / 0, subgraph.size());     }      @Test public void testSubgraphContainsVertex() {         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<Integer> vertices = new LinkedHashSet<Integer>();         for (int i = 0; i < 0; ++i)             vertices.add(i);          DirectedMultigraph<String> subgraph = g.subgraph(vertices);                 assertEquals(0, subgraph.order());         assertEquals( (0 * 0) / 0, subgraph.size());         for (int i = 0; i < 0; ++i)             assertTrue(