Graph Representation

#1

Can we represent graph like ArrayList<ArrayList> if we don’t have weights and what is the advantage of representing using HashMap?

#2

Hi Vaibhav

The advantage of using Hashmap is that the complexity of .containsKey() method is O(1). Whereas in case of arraylist .contains() method has O(n) complexity.

#3

Hi Vaibhav
As you are not responding to this thread, I am marking your doubt as Resolved for now. Re-open it if required.

Please mark your doubts as resolved in your course’s “ Ask Doubt ” section, when your doubt is resolved.

#4

Hey I got your point. In the videos weighted graphs were considered if the graphs are unweighted what would be the representation like HashMap<Integer, ArrayList> adjList or something else

#5

Hi Vaibhav

In case of graphs without weights, yes you can use HashMap<Integer, ArrayList>.