Java - Which is the best implementation structure for Graph?

Question

The graph is very large but undirected. Edges are unweighted.

In my implementation, I have to find the vertex with max degree and do deletion on both vertexes and edges.

Answer 1

From the above suggested the answer would be

Map with LinkedList...

Your datastructure could be like this(varies according to your requirement)...

Map>

Basically, Graphs are best implemented with the help of HASHING and the above datastructure helps a lot in that..