Is adjency list the best possible optimized way to store graphs???
Graphs storage adjency list
it generally depends upon the questions, some questions it will be easy to solve them using the edge matrix, some with edge list, and some by adjacency list
but adjacency list is the most common one of all, it covers maximum cases and easy to traverse and link
specially where the numbers used are same as indices, vector can be easily used