Data Structures using C Part 29 - Adjacency List Representation of Graph in c programming

[@AnkproTraining]

Thank you for watching this video. Cheers! would you mind hitting *_like_* button and *_subscribe_* to our channel! That will be awesome. We would be grateful to you. And also share this video in your circle via whatsapp, facebook and twitter. Link to subscribe the channel goo.gl/hFueBi

[@chillxstreams6833]

After finding so many videos about the Adjacency list i am not able to understand from them. Your This video is just amazing And you clear my all doubt. All other are representing this Program in the cpp with the help of the vector which is not worth it in the data structure. Thank you man for making this video.

[@AnkproTraining]

Glad it was helpful! Thank you for watching this video. Cheers! would you mind hitting like button and subscribe to our channel!
That will be awesome. We would be grateful to you. And also share this video in your circle via whatsapp, facebook and twitter.

[@meenakshihattewar5811]

Great Explanation Sir,
I suppose this is a directed graph , for ex: when we will traverse the graph we have 0(src) -> 1(dest) but not 1(src) to 0(dest)

[@yogeshrawat1204]

Best explanation of adjacency list on you tube👍

[@AnkproTraining]

Thank you for watching and commenting.
Cheers! would you mind hitting *_like_* button and *_subscribe_* to our channel!
That will be awesome. We would be grateful to you. And also share this video in your circle via whatsapp, facebook and twitter.

[@yogeshrawat1204]

Why not.... Done👍

[@soumikdc]

Great video..really helped me. One query, couldn't we have used the array to store the vertices data itself? There could have been another 'int' variable in 'adjlist' and while initialising the array in main function we could have the stored vertices value (0,1,2 and so on) in the variable?

[@dhananjayjadhav7064]

Such a great explaination 😊😊

[@AnkproTraining]

Glad you think so! Thank you for watching this video and commenting.
Cheers! would you mind hitting *_like_* button and *_subscribe_* to our channel! That will be awesome. We would be grateful to you. And also share this video in your circle via *WhatsApp* , *Facebook* and *Twitter* . Link to subscribe the channel goo.gl/hFueBi

[@sagaralwani75]

Hello Sir great Explaination but in print function i think the loop should start from 0 such that adjlist[0] be acccessed.. isn't it?

[@abhishekfasate2872]

🔥🔥🔥🔥🔥🔥🔥🔥🔥🔥🔥🔥🔥🔥🔥🔥🔥🔥🔥🔥🔥

[@AnkproTraining]

Thank you for watching this video. Don't forget to *_like , subscribe_* and hit that *_notification_* bell 🔔. And also share this video in your circle via *WhatsApp* , *Facebook* and *Twitter* . Link to subscribe the channel goo.gl/hFueBi

[@deepakborah8335]

Good video on data structure to represent graph using linked list.

[@AnkproTraining]

Thank you very much. Please do share the video in facebook, twitter and whatsapp. And also do not forget to subscribe to our channel.😀

[@bibiayesha4123]

It really helped me

[@bibiayesha4123]

Thank u , u explained so well👍👍

[@francoisallouin1865]

Thank you for sharing. There is however a huge problem in the while loop. a while loop is not an if/else loop. Hence, it does not mean " until" but "as long as". great job though.

[@AnkproTraining]

Thank you for commenting and sharing your thoughts. Please share the video in your network via facebook, twitter and whatsapp.😀

[@randomengineer8560]

Bah alors françois

[@HARSHKUMAR-p2f]

Great sir

[@ysaianusha2198]

Sir very well explanation. Can you pls do a video on implementation of BST using linked list

[@AnkproTraining]

Thank you for watching this video and commenting.
Cheers! would you mind hitting *_like_* button and *_subscribe_* to our channel! That will be awesome. We would be grateful to you. And also share this video in your circle via whatsapp, facebook and twitter. Link to subscribe the channel goo.gl/hFueBi

[@69upasonabiswas88]

Very well explained sir! Thank you so much.. :)

[@AnkproTraining]

Thank you for watching this video and commenting.
Cheers! would you mind hitting *_like_* button and *_subscribe_* to our channel! That will be awesome. We would be grateful to you. And also share this video in your circle via whatsapp, facebook and twitter. Link to subscribe the channel goo.gl/hFueBi

[@upasonabiswas6783]

Yes sure!❤️

[@kunalkumarshrivastava]

Great Explaination Sir!

[@AnkproTraining]

Cheers! would you mind hitting *_like_* button and *_subscribe_* to our channel!
That will be awesome. We would be grateful to you. And also share this video in your circle via whatsapp, facebook and twitter.

[@NOOR-dy6yn]

Thanks Sir

[@pankajrathore6316]

how nice you explain it,,sir

[@AnkproTraining]

Thank you for your comment. Please share this video in your circle via whatsapp, facebook and twitter. Subscribe to our channel.

[@Srcb-q7s]

Thank you

[@AnkproTraining]

You're welcome, Don't forget to *_like , subscribe_* and hit that *_notification_* bell 🔔. And also share this video in your circle via *WhatsApp* , *Facebook* and *Twitter* . Link to subscribe the channel goo.gl/hFueBi

[@shankarghimire4492]

Thank you so much for the awesome tutorial!
God bless you!
:):):)

[@AnkproTraining]

You're very welcome! Thank you for watching this video and commenting.
Cheers! would you mind hitting *_like_* button and *_subscribe_* to our channel! That will be awesome. We would be grateful to you. And also share this video in your circle via *WhatsApp* , *Facebook* and *Twitter* . Link to subscribe the channel goo.gl/hFueBi

[@souravpaul2242]

THANKS A LOT !!!!

[@Blure]

Solid explanation. Thank you.

[@AnkproTraining]

Thank you for watching and commenting. Cheers! would you mind hitting *_like_* button and *_subscribe_* to my channel!
That will be awesome. I would be grateful to you. And also share this video in your circle via whatsapp, facebook and twitter.

[@theWorldOfIss]

Amazing 💕

[@AnkproTraining]

Thanks 🤗Glad it helped! Subscribe and share the video.

[@AKGamersLite]

I don't think this is a good implementation of what you were showing earlier on in the video..
Firstly lets say I use exact same code as you in the end:
addNode(0,1);
addNode(0,3);
addNode(1,2);
This is what shows when you run:
Adjacency list for vertex 0
0 1 3
Adjacency list for vertex 1
1 2
Adjacency list for vertex 2
Adjacency list for vertex 3
As you can see this is incorrect. Output should be like this:
Adjacency list for vertex 0
0 1 3
Adjacency list for vertex 1
1 0 2
Adjacency list for vertex 2
2 1
Adjacency list for vertex 3
3 0
You need to make it so the edge is shown from source to destination, and destination to source. You need to do both ways!

[@sarthakn4398]

Thank you ....It helps me in implementation of code.

[@AnkproTraining]

Thanks. Please like this video, Share it in facebook, twitter and Whatsapp. Do not forget to subscribe to our channel.

[@kausachan4167]

good video man

[@AnkproTraining]

Thank you *Kuasa* for watching this video and commenting.
Cheers! would you mind hitting *_like_* button and *_subscribe_* to our channel! That will be awesome. We would be grateful to you. And also share this video in your circle via whatsapp, facebook and twitter. Link to subscribe the channel goo.gl/hFueBi

[@deepaksinghverma8751]

Thank you so much nice explaination

[@AnkproTraining]

Thank you for your comment. Share this video link in your network with your friends via facebook, whatsapp and twitter.😀

[@SwetaBardhan3]

How is list[0] pointing to 0
You explained that there's no self loop consideration
Plz explain

[@mandar.vaidya]

Good explanation , can you just correct while condition

[@rupaliagrahari6059]

Yes something is wrong in while loop of addnode..
Did u correct it..?

[@weisiqi685]

thank u for the code! its really clear!!!

[@AnkproTraining]

Thank you very much. Please subscribe to our channel. Share our videos in facebook, Whatsapp and twitter if you like any of our videos.😀

[@Moments551]

I have problem printing the list because some of my vertices does not have any edges to any vertices.

[@francoisallouin1865]

in the while loop: add a curly brackets between temp=temp->next; and temp->next=dest; to make it work.

[@SwetaBardhan3]

That's not required

[@princesspiem5901]

How to print the path after this

[@alperyilmaz6147]

can u share codes?

[@spidey7771]

Here code:
#include
#include
#define maxNode 4
typedef struct Node {
int vertexNum;
struct Node* next;
}Node;
typedef struct List {
Node* head;
}List;
List* adjlist[maxNode] = {0};
void addNode(int s,int d)
{
Node *dest,*tmp,*src;
if(adjlist[s]->head==NULL) {
src = (Node*)malloc(sizeof(Node));
src->vertexNum=s;
src->next=NULL;
adjlist[s]->head = src;
}
dest = (Node*)malloc(sizeof(Node));
dest->vertexNum=d;
dest->next=NULL;
tmp=adjlist[s]->head;
while(tmp->next!=NULL){
tmp=tmp->next;
}
tmp->next=dest;
}
void printList(){
int i;
for(i=0;ihead;
printf("Adjacency list for vertex %d
",i);
while(p) {
printf("%d",p->vertexNum);
p=p->next;
}
printf("
");
}
}
void main()
{
int i;
for(i=0; ihead = NULL;
}
addNode(0,1);
addNode(0,3);
addNode(1,2);
printList();
}

[@shouvikdutta2825]

While loop condition is absolutely wrong.

[@meenakshihattewar5811]

Instead we can write......
Do{
Printf("%d",p->vertexNum);
p=p->next;
}while(p->next != NULL)

[@林書佑-o6f]

@@meenakshihattewar5811 not not sir . is while(p!=NULL)

[@Bhanu-x8o]

Sir explain adjacent list . But not understand sir

[@lakshmikanthagc366]

Can you pl share your ppt...

[@Sonofpeace]

not working !
Segmentation fault

[@deepanshu7562]

code de dete to shi rehta.
isliye mene video like nhi kri