Representation of graph using adjacency matrix and adjacency list

This video explains the method to represent an undirected graph as well as a directed graph using adjacency matrix and adjacency list. I have also explained the advantages and disadvantages of using adjacency matrix and adjacency list and also the different situations suitable for them to be used in. If you find any difficulty or have any query then do COMMENT below. PLEASE help our channel by SUBSCRIBING and LIKE our video if you found it helpful...CYA :)

[TomerBenDavid]

Cool searched for "adjacency list tech doze" because I knew there would be the best concise explanation in a short time and it prooved right.

[indraalapati]

Nice explanation. I would like to add one more point under adjacency list -> If your model frequently manipulates vertices, the adjacency list is a better choice.

[RANAND-xdzu]

Sir, you made a mistake from the adjacent list 1 pointing through 0, 2 and 3 you forget the 0 this is an undirected graph

[MyboyCelticSteel]

Great video! Super clear and one of the better ones available on YouTube! Much thanks Sir!

[udithweerasinghe]

in the adjacency list, you marked from 1 to 2 & 3 only, don't we need to mark for 0 as well since there is a link from 1 to 0?

[sidharthpurohit]

Keep up the great work sir :)
Very well curated lectures.
Thank you.

[SiddharthRay]

why array of pointer "1" don't have node 1 to 0 ? since "2" does have 2 ti 1 and 2 to 3

[RanjanaShinde-el]

Thank you so much sir for giving nice explanation ☺️

[toobaa]

which software you are using for drawing adjacency matrix and list in this video?

[thetechmasum]

Code implementation is missed. I have one doubt if we have nodes with big number like 160, 300, 2000, 5000 how that will be mapped to array index while representing by adjacency list.

[saipraneethtalluri]

Commenting as it can reach to more people ❤️

[sakshidongare]

Great video it's very easy to understand but I need inverse adjacency list examples

[atharvsatpute]

Sir. Their was 3 edges from vertex 1 =1-0, 1-3, 1-2
You don't mention in adjacency list at video time 5:28 please check ti if I write

[rahulsaw]

Does graph only contains the sequence labelling of data such as 0 1 2 3 for 4 nodes can we have 34 79 82 12 in vertice labelling

[naveenkumar-rbug]

Sir you used Source nodes as node pointers. But in real world there is lot of information associated with a node. So how can we implement that as pointer only. Dont we need to have an array of Vertices nodes instead of Vertices pointer array. Plz clarify

[sanjaykumar]

What is the application of adjacency matrix and list

[vikasrai]

Great Explaination Sir.
I have a request, can you please make a video on ways to implement the graph DS in C++, because there are lot of ways(vectors, set, array of LL etc) and it quite confusing.

Thanks in advance. @techdose

[akashtanajigurav]

adj list is wrong the 1 have the 0, 2, 3 b relations

[English-zvjk]

5:07 here 1 should be linked with 0 also naa?? He hasn't written that

[sayantaniguha]

From this explanation it isn't clear that how do we represent a flower-like directed graph using Adjacency List.

🌻-like i.e., where the "black thing at center" is node 0 / petals are edges & petal tips are other nodes...