title: Java - Which is the best implementation structure for Graph?
body: <p>The graph is very large but undirected. Edges are unweighted.</p>
  
  <p>In my implementation, I have to find the vertex with max degree and do deletion on both vertexes and edges.</p>
  
  <p>Linked list? ArrayList? Map?</p>
  
  <p>Which one is better for my implementation?</p>