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 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?
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.
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
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
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...
![⭐ฮิตในTikTok!! ( มะมะมะหมูเด้ง MooDeng ) Ver. แดนซ์ ReMix BY [ ดีเจกิต รีมิกซ์ ]](http://i.ytimg.com/vi/4noyAoMa7bQ/mqdefault.jpg)
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.
:P thanks but it's dose Hahaha :)
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
Yes i noticed aswell.
RIGHT
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.
Thanks :)
Great video! Super clear and one of the better ones available on TH-cam! Much thanks Sir!
Keep up the great work sir :)
Very well curated lectures.
Thank you.
Welcome :)
This video tutorial is very helpful
Thanks :)
Thank you so much sir for giving nice explanation ☺️
This video was a very big help ♥
:)
awesome explainer
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?
He forgor☠
it is undirected graph so you are right
Commenting as it can reach to more people ❤️
Simply excellent narration
Thanks
Amazing bht achi samjh ai sir
Badhiya 👌🏼
why array of pointer "1" don't have node 1 to 0 ? since "2" does have 2 ti 1 and 2 to 3
Yes you are correct. I should have included 0. 0 will be present in array of pointers for node 1.
@@techdose4u thanks for the response. video was awesome 👌
Thanks for pointing out the mistake bdw.
He forgor💀
Great video sir😍👍..... it's very easy to understand but I need inverse adjacency list examples
Finally I am at Graph.
👍🏼
great video
Huge help bro, thanks
Welcome
@@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?
good one
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
which software you are using for drawing adjacency matrix and list in this video?
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.
that's impressive
Thanks :)
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
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
It's the same thing in this case. It just serves to visualize it, it's not an actual linked list.
What is the application of adjacency matrix and list
You will understand as see more of the videos in graph playlist.
Can yoy share some link of application because i am needy for that
To store a graph or to represent it, you need either adjacency list or matrix.
where is code sir
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
Yes I will make after including all videos of graph.
@@techdose4u How many videos ????
@@dfrsacw3988 5-6 videos approx. You can remind me after couple of weeks for this topic.
@@techdose4u OK. Thank you. :)
Pls I am reminding my problem 😂
5:07 here 1 should be linked with 0 also naa?? He hasn't written that
Yes
adj list is wrong the 1 have the 0,2,3 b relations
❤
adjancy matrix is easy
Yaa it is :)
guru you make it easy
Thanks :P
Everything is easy.. sikhne k liye bas junoon chahiye
@We Can 🤣
👍
👍
Not great video bros he didn't explained loop in directed graph for adjacency list
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...
READ ABOUT ISLAM ❤