More accurately, it gives you an array that can hold 100 Vectors of Vertex.
It doesn't give you any actual Vectors, you have to new them all up yourself.
But also, it doesn't work.

import java.util.Vector;
public class Test {
   public static class Vertex {}

   public static void main(String[] args) {
       Vector<Vertex>[] vertexVectors = new Vector<Vertex>[1];
   }
}

Test.java:7: generic array creation
       Vector<Vertex>[] vertexVectors = new Vector<Vertex>[1];

You can specify just "new Vector[1]" and it works with a warning. I don't know
why it's disallowed to create an array of type-specified generic objects.
I hope someone here does :)

I fully agree that the OP may not actually want an array of vectors, but just
a Vector (or ArrayList) of Vertex.  Generally, you don't mix array and List
usage, and arrays of lists are just confusing.  When you want a
two-dimensional representation, use:
 Vertex[][] vertices;
or
 List<List<Vertex>> vertices;

Huh?  How does Vector provide different access than ArrayList?  Vector is
synchronized, but otherwise ArrayList is a drop-in replacement.
--
Mark Rafn    dagon@dagon.net    <http://www.dagon.net/>

Huh?  This is not true at all.  Vector provides the same random access as
ArrayList, and the same solution for "frequently growing {sic}" arrays.
Vector carries some cruft from its pre-Collection days, but that has nothing
whatsoever to do with an "array" nor with how it grows nor with random access.
 The difference is that Vector methods are synchronized on the Vector
instance and ArrayList methods are not synchronized.

To the OP - always double-check newsgroup answers. Even (perhaps especially?)
this one. "Trust but verify."

-- Lew

But it's not generic, and you have to cast things when you get stuff out
of the array.
--
Mark Rafn    dagon@dagon.net    <http://www.dagon.net/>