title: Java Adjacency list implementation of graph with directed weighted edges
body: <p>I am trying to implement a directed weighted edge graph in Java using adjacency lists. It consists of an array with the size equal to the number of vertices, each entry of the array is a <code>LinkedList</code> of the successors of that each particular <code>Vertex</code>. </p>
  
  <p>I want to add weight to each edge, I was thinking of doing this by adding a weight label to each <code>successor</code> Object in the <code>LinkedList</code>, furthermore I want to add other variables per <code>Vertex</code> for future use. If I want to do this, I would have to create a new Data structure for the vertices and a separate one as an adjacency lists. What would be an efficient design to combine both as a single Data structure?</p>