Stl challenge quiz 2 quest 9

#1

did not get how the undirected graps can be represented in various forms

#2

Hey @mansi25
vector < int > graph [ N + 1 ]

bool graph [ N + 1 ][ N + 1 ]

vector < vector < int > > graph(N+1)

All of them .

1st and 3rd option can be used to create graph as adjacenecy list
And 2nd option as adjacenecy matric