03. Graph Data Structure | Creating Adjacency List in C++ | Coding Blocks

preview_player
Показать описание
In this video, Prateek Bhaiya, explains the concept of Creating Adjacency List in C++.

🔔 Subscribe the channel and press the bell icon for notifications!

----------------------------- About Coding Blocks ---------------------

Coding Blocks, India's best Programming and software training institute offers courses like C++ and Java, Data Structures and Algorithms, Web and Android Development(Java and Kotlin), Competitive Programming, Coding Interview Preparation, Machine Learning, AI and more. Registration open for Online and Offline Coding classes. Take advantage of the professionals who have worked with bigwigs like Sony, Cyanogen, Micromax.

#GraphDataStructure #AdjacencyMatrix #AdjacencyListGraph

Stay Connected:-

Hit the Like, Share, & Subscribe button if you liked the video! You can comment your thoughts, questions, and doubts related to the video in the comment section & our mentors/counselors shall revert back!

Рекомендации по теме
Комментарии
Автор

Can't thank you enough... I was always scared of graphs idk why let alone implementing it in C++....these videos has helped me alot to overcome that fear and now I am really comfortable with graphs...even solved a few problems on leetcode on my own.

shivamagarawal
Автор

This video saved my life. I was breaking my head to learn graphs for a long time. Thanx Prateek. You are awesome! Prateek OP!!

bsethupathi
Автор

Thanks a lot!!! Im really struggling to learn graphs for a week and you just taught me graph in 8min. Dude create more tutorial like this!

peleboykulot
Автор

Thanks! Helped me understand the basics of a graph.

dev_casper
Автор

your explaination is very good, loved it

BloodFang-ju
Автор

search for this kind of video form 3 days.finally got it. Thanks

abhi
Автор

a very simple explanation of a complex concept, great video !!!

geovanyteca
Автор

Thanks a lot sir for this video. You explained the code in a simple and easy manner.

sanket
Автор

wrong method of initialisation
list is always dynamic so how can u initialise it again with new list<int> ....

vaibhavpallod
Автор

Thank you so much for walking through the entire code. Helped a lot. Also thanks for doing it in English :)

shaheenrafiq
Автор

when someone try to solve graph's questions, he/she don't understand the structure of graph how it will be represent apart from dfs/bfs a student havnt idea about only the traversal. in the tutorials everywhere everyone only told how to traverse the graph bfs/dfs none of the tutorials told about the adjacency list, what is that how to acces data from it, how to traverse adjacency list, when we know about the adjacency list automatically we can understand the graph. thanks man

SatnamSingh-skhd
Автор

Got it.
But I came here to store not only vertices and edges. I thought you will also expalin how to store weights on every edge.

arunlabana
Автор

Thankyou very much bhaiya it really helps me a lot.

namangupta
Автор

Sir for adjacency elements for loop syntax samaj ni aaya
For(int x:adj[v]){
Cout<<x;}
How it work please shows step by stert

memeswallah
Автор

what if we had A, B, C, D.... as vertices how willl be index and store?

kausachan
Автор

Feels a bit complicated to a beginner.
Vector of an array would have been easier or even vector of Vector.

gamingfingers
Автор

Can be use array of vectors for creating adjacency lists?

ahanmr
Автор

You have no idea how happy you made me... I thought I will never understand graphs😅

paula
Автор

Good one. But how u write....during coding ...at right side how u explain ...means which method u have used for making video.. please tell

anjalialmale
Автор

he teaches nicely peopleonly are not paying attention then they blame him that he is teaching like reading a book.

tombrady