Representation of graph using adjacency matrix and adjacency list

Подписаться 176 тыс.

Просмотров 85 тыс.

50% 1

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 :)

Опубликовано:

30 сен 2024

Ссылка:

Скачать:

Готовим ссылку...

Добавить в:

Мой плейлист

Посмотреть позже

Комментарии : 72

@RANAND-xd3zu 4 года назад

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

@muhammadzakiahmad8069 2 года назад

Yes i noticed aswell.

@abrarmojahidrafi4509 11 месяцев назад

RIGHT

@TomerBenDavid 4 года назад

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.

@techdose4u 4 года назад

:P thanks but it's dose Hahaha :)

@udithweerasinghe6402 Год назад

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?

@atharvameher5880 Год назад

He forgor☠

@emmanuelnsiah8036 5 месяцев назад

it is undirected graph so you are right

@indraalapati989 4 года назад

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.

@techdose4u 4 года назад

Thanks :)

@SiddharthRay1 4 года назад

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

@techdose4u 4 года назад

Yes you are correct. I should have included 0. 0 will be present in array of pointers for node 1.

@SiddharthRay1 4 года назад

@@techdose4u thanks for the response. video was awesome 👌

@techdose4u 4 года назад

Thanks for pointing out the mistake bdw.

@atharvameher5880 Год назад

He forgor💀

@jk-xo8rc 2 месяца назад

❤

@sidharthpurohit3670 3 года назад

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

@techdose4u 3 года назад

Welcome :)

@atharvsatpute7889 6 месяцев назад

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

@MyboyCelticSteel786 2 года назад

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

@varundawan3637 9 месяцев назад

Not great video bros he didn't explained loop in directed graph for adjacency list

@dangelokwakye6658 4 года назад

This video was a very big help ♥

@techdose4u 4 года назад

@akashtanajigurav8226 Год назад

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

@DineshSharma-pp3ox 2 года назад

This video tutorial is very helpful

@techdose4u 2 года назад

Thanks :)

@antiviruskaif8297 Месяц назад

awesome explainer

@MDIRFAN-cp7ol 2 года назад

where is code sir

@thetechmasum 2 года назад

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.

@RanjanaShinde-e1l 7 месяцев назад

Thank you so much sir for giving nice explanation ☺️

@rahulsaw8838 2 года назад

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

@sakshidongare9346 2 года назад

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

@sanjaykumar7798 3 года назад

What is the application of adjacency matrix and list

@techdose4u 3 года назад

You will understand as see more of the videos in graph playlist.

@sanjaykumar7798 3 года назад

Can yoy share some link of application because i am needy for that

@techdose4u 3 года назад

To store a graph or to represent it, you need either adjacency list or matrix.

@mwshubham 2 года назад

Finally I am at Graph.

@techdose4u 2 года назад

👍🏼

@toobaa3919 3 года назад

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

@impatientgaming9868 9 месяцев назад

good one

@eramali3237 3 года назад

Amazing bht achi samjh ai sir

@techdose4u 3 года назад

Badhiya 👌🏼

@saipraneethtalluri652 3 года назад

Commenting as it can reach to more people ❤️

@naveenkumar-rb4ug 3 года назад

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

@darellarocho5729 Год назад

It's the same thing in this case. It just serves to visualize it, it's not an actual linked list.

@Yoshi-bw8ds 3 года назад

Huge help bro, thanks

@techdose4u 3 года назад

Welcome

@dewman7477 3 года назад

@@techdose4u Hey I have a question. How do I implement an algorithm to reduce the graph from weighted to an unweighted graph? Let’s say I’m given a set of edge weights like {1, 2} in a weighted undirected graph. How do I transform a graph so that all edge weights in a graph are equal (where preferably each edge weight in new graph equals to 1)? I know I may have to add or remove edges and intermediate vertices but is there a way to think about this?

@English-zv3jk 2 года назад

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

@justtavi1238 Год назад

Yes

@rahulagarwal8059 3 года назад

👍

@techdose4u 3 года назад

👍

@abhaytiwari6411 4 года назад

that's impressive

@techdose4u 4 года назад

Thanks :)

@sot5789 2 года назад

great video

@abhaytiwari6411 4 года назад

adjancy matrix is easy

@techdose4u 4 года назад

Yaa it is :)

@abhaytiwari6411 4 года назад

guru you make it easy

@techdose4u 4 года назад

Thanks :P

@YashDEVELOPER12 4 года назад

Everything is easy.. sikhne k liye bas junoon chahiye

@YashDEVELOPER12 3 года назад

@We Can 🤣

@mcmouli2002 3 года назад

Simply excellent narration

@techdose4u 3 года назад

Thanks

@vikasrai4915 4 года назад

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

@techdose4u 4 года назад

Yes I will make after including all videos of graph.

@dfrsacw3988 4 года назад

@@techdose4u How many videos ????

@techdose4u 4 года назад

@@dfrsacw3988 5-6 videos approx. You can remind me after couple of weeks for this topic.

@dfrsacw3988 4 года назад

@@techdose4u OK. Thank you. :)

@janvimyadventures1310 3 года назад

Pls I am reminding my problem 😂

@sayantaniguha8519 2 года назад

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...