I dont mean to be so off topic but does anybody know of a trick to log back into an Instagram account?? I was dumb forgot my password. I would love any help you can offer me!
@Dane Bronson Thanks so much for your reply. I got to the site thru google and I'm in the hacking process atm. I see it takes quite some time so I will reply here later with my results.
I watched like 3 other videos on graphs. People use over complex vocabulary and don't explain what is happening properly. It was easy for me to understand graphs with this video. Thank you!
@time 6:42 , by removing an edge ,we just need to make the corresponding entry from 0 to 1 ==> is said, but it should be 1 to 0.so please make a note abv.
These videos are really helpful, I always use GFG just for the codes and all and never even tried watching them, but as it turns out now is that I'm wrong. Great Job Guys!!
So if we say that an entry in i'th row and j'th column is 1 means that there is an edge "between 0 and 1". Quoted from the audio at 4:22. Does that seem correct?
Saying simply: if value is 1, there is "DIRECT" connection between two edges, otherwise both edges are connected but not DIRECTLY. That's why we write 0.
Because we need to update result of all the previous verticies with this that vertex. If u don't know addition of matrix u can go through that first...
In the adjacency list representation, each element 'array[i]' represents the list of vertices linked from the ith vertex. So, the code "graph->array[i].head = NULL;" implies that we're initializing the head node of the ith list as NULL.
At 1:50 it's "pair of *unordered vertices".
I dont mean to be so off topic but does anybody know of a trick to log back into an Instagram account??
I was dumb forgot my password. I would love any help you can offer me!
@Dane Bronson Thanks so much for your reply. I got to the site thru google and I'm in the hacking process atm.
I see it takes quite some time so I will reply here later with my results.
@Dane Bronson it worked and I finally got access to my account again. I'm so happy!
Thank you so much you really help me out :D
@Howard Lucca Glad I could help xD
I watched like 3 other videos on graphs. People use over complex vocabulary and don't explain what is happening properly. It was easy for me to understand graphs with this video. Thank you!
@time 6:42 , by removing an edge ,we just need to make the corresponding entry from 0 to 1 ==> is said, but it should be 1 to 0.so please make a note abv.
Thank you, Ravi.
I'll add a note in the video.
Nice Video! Question: 7:40 add one vertex in adjacency matrix is 2xV, no? Just add one row and one column. please advice. Thanks!
6:48 Should not removing an edge be changing value from 1 to 0 ???
Thank you for giving real world applications! It’s such an issue when trying to learn anything when nobody gives you any reason to learn it
THANK YOU very much for using ENGLISH to teach us because everyone can be benefited
GeeksforGeeks is by far better than my college in teaching programming.
thank you so much GeeksforGeeks team I have learned a lot from you.
These videos are really helpful, I always use GFG just for the codes and all and never even tried watching them, but as it turns out now is that I'm wrong. Great Job Guys!!
So if we say that an entry in i'th row and j'th column is 1 means that there is an edge "between 0 and 1".
Quoted from the audio at 4:22. Does that seem correct?
Saying simply: if value is 1, there is "DIRECT" connection between two edges, otherwise both edges are connected but not DIRECTLY. That's why we write 0.
this is my first video of watching GeeksforGeeks and it is very helpful and the best video for this topic in total you tube
Wow, I didn’t know you guys had a RUclips channel.
This video has very helpful information for introduction to graphs. Thanks GeeksforGeeks!
Why is adding a vertex v^2?
Because we need to update result of all the previous verticies with this that vertex.
If u don't know addition of matrix u can go through that first...
If we have a big number of verter and edges which shoud will be use ? Adjacency list or Adjacency matrix ?
Adjacency List
sir, is any order to put vertex values into list?
What is advantage and disadvantage of using multilist representation.
Kindly explain the same
I expected he would expalin the code part too. But still it was good. Thank you!
Thanks for the feedback Venkata! You can find all graph related problems on the following playlist: ruclips.net/p/PLqM7alHXFySEaZgcg7uRYJFBnYMLti-nh
sir plz tell me me graph representation of adjacent list how 4 is connect to 2
Thanks for the video! And can you give the link of the implementation you showed at that last min? Thanks!
Explanation is amazing but the sound is low.
graph->array[i].head = NULL; What does this code means?
In the adjacency list representation, each element 'array[i]' represents the list of vertices linked from the ith vertex.
So, the code "graph->array[i].head = NULL;" implies that we're initializing the head node of the ith list as NULL.
well explained
Thank you for your generosity in knowledge sharing.
can u share an easy implementation of list and matrix using stl
best lectures ... but bro thora jor se bolo yrr ..i have to concentrate more on listening than thinking
Thanks for the feedback. We will share this with the contributor.
GeeksforGeeks I didn't get the c code someone help please
love this guy's voice it's so nice
THIS WAS SO HELPFUL THANK YOU
Hi. Please can you help me solve this?😭
Where is multi list representation ?
Awesome👏✊👍......
Watch with 1.5x speed
Thank u gfg i will join full course soon.
graph from adjacency matrix
Plz write in capital lett
damn master oogway, i cant focus.
I have 24hrs to master graphs and take on a challenge, with at least 6 hours of sleep and 9 hours of work.
Go help me.
Thank you
Bro really ? illuminati ?
Very nice video
good tutorial thank you
Thank you!
very helpfull
Thanks
Good
Good useful
too be honest video bakwas laga ...or akhri main code wala to pura e bakwas ...ppt se dikha ke chod diya