Graph Representation part 01 - Edge List

[@saugatkafley5153]

Your lectures are still highly effective and subsquently better than other existing tuts . Watching this in 2020 feels like watching a retro tuts.

[@OFaruk58]

Watching it in 2021 still very effective and helpfull, way more then my teachers and school lectures.

[@harshtripathi1291]

but he is no more

[@zameeransari1530]

@@harshtripathi1291 No, Animesh the narrator here is still alive and well, it was Harsha who passed away, may his soul rest in peace.

[@ChickenMaster7]

@@OFaruk58 Watching it in 2022, how about that?

[@manishkumargupta8677]

@@ChickenMaster7 that means it helped a lot to our seniors

[@sanjayakumarsahoo2293]

Thanks for your posts, Its thousands time better watching your videos than reading data structure algorithm books

[@Dreamazium]

I second that.

[@DarKCremeTai]

Best code teaching channel! Well done, everyone! Please make more and more!!! Thanks

[@RaniLink]

My god.... this is amazing! I actually sent my incompetent lecturer a link to this channel so he sees how this course should actually be taught, after I finished the course.

[@priyanshugupta7904]

I don't understand why THE teacher like you say "thank you" at the end of the video....I think the person watching the video should thank you instead of You thanking the viewer....These videos are really great.. THANK YOU SIR

[@simplifycs8753]

Hi Priyanshu pls checkout my explanation also kzbin.info/www/bejne/pHKXmKmgmNRngas

[@VaibhavChauhan08]

Finally! Its so good to see you back. I hope you're doing well and you have my wishes. :')

[@every_instant]

the logic of ur explanation is very natural ! what a talent !

[@rohankademani6406]

best videos on DS

[@helmus2000]

Looking forward to the next lesson !

[@avinashchaurasiya6497]

Such an evergreen tutorial for data structures.

[@PawanKumar-tu6ti]

Sir, Please look forward to working more on this best curated playlist! That would be so nice of you! A star is born! 😍

[@krishnodas6678]

He passed away from us many years ago

[@PawanKumar-tu6ti]

@@krishnodas6678 Yeah, got aware about it recently.

[@michaelsantos5055]

You are an amazing teacher, these videos are the best I’ve watched on graph representation and time/space complexities!

[@srjbora]

Welcome back , A series on competitive programming and various algorithm design paradigms would be appreciable. Thanks

[@shreyasbhale2578]

Great to see that you are back, the way you explain the things is very simple, even a layman can understand the things easily if he will follow your videos. I am thankful to you because of you I have developed strong interest towards data structures. Your tutorial is so far the best which I have seen.

[@pranavganorkar2379]

Glad to see you back !!!

[@Mariekristienharmsen]

Thank you so much for this video. Really makes the whole concept easier !

[@sserdar415]

Thanks for these well prepared lessons. Made all these concepts easier to understand.

[@syedmeesam7404]

Plz upload videos on graph traversal

[@anjith]

I've been going through your videos. You're really good at clearly explaining the concepts are your examples are on point. Thank you. I have subscribed.

[@rajasaad9589]

The best explanation ever looked on graphs!! (y) Keep on doing great work...

[@abhi1110]

He expired bro

[@lokeshsingal1937]

Welcome Back !! Waiting for the next video's from last month.. great work !!!

[@rajnishmaurya9823]

you guys really bring the best stuff, been very useful to me. Could you make a series on Algorithms?

[@saraswathiseemakurthi3022]

sir please upload the video of Dijkstra's algorithm implementation

[@singhabhay1810]

Thanks for posting. u have a special gift of making things simple.

[@AeroPR]

Amazing series you created

[@shivparvatisharmafamily5706]

thanks for all your lectures

[@sartajnawaz3484]

You legend!!! You're back!!!

[@tsolimaninf]

Can't wait for part 02 !

[@FitCoder]

Great video. Looking forward to more such videos.

[@keerthi9865]

sir ur videos are highly informative......can u plz post videos on heaps and hashing.

[@therealsumitshah]

Explained really well!

[@binatealeem5867]

best explaination......outstanding at teaching......well done sir!

[@akashtomar2761]

Can't wait for more tutorials on graphs...great work there thanks a lot ;-)

[@usama57926]

amazing playlist

[@tomasz-rozanski]

9:23 If |V|

[@eyalpery8470]

I'm glad that I saw those videos. Great!

[@kunalkpotdar]

you made it so simple. thanks for sharing, waiting for next..

[@RawanLaz]

thanks a lot for all your lectures

[@azizas9366]

please a series on algorithms , thanks a lot

[@princesharmasharma3287]

glad to see u again

[@my_religion]

Helpful as always, thank you!

[@janygorusu8318]

Great Lesson on applied math and CS. Thanks

[@CuriousAnonDev]

hey, can you guide me where should I learn next concepts as this person stopped creating lessons!

[@vu5700]

Brutal tutorial

[@halahmilksheikh]

Welcome back!

[@ivandrofly]

Here again to say thank you

[@acanimationfilmstudio1018]

So this is the staffs for half edge data structures,am doing a software 3d using python and I have reached for the subdivision

[@amarmakana9877]

As others said the algorithms are well explained and especially with giving insights with regards to time and space complexity in really storing a graph into computer’s memory, etc are very helpful in understanding the details. I have a doubt at around 13:00 minutes of the video where you mentioned maximum edges are n(n-1) for a directed graph and n(n-1)/2 for an undirected graph where n being number of vertices. In the previous video I understood it as the other way. Can you please check and correct?

[@prajjwalsingh6490]

YOU ARE THE BEST!!!!!!!!!!!!

[@anithabhuvanasi7510]

Ur explanation was so clear.why can't you start ur videos on Java also.

[@eswarkolla1452]

Could you please make a few video tutorials on Bit-wise operators and their applications. Its hard to find bit-level programs explained. It would be great to learn about those applications from you :)

[@ghsmullahera3879]

great job....

[@Unharmed]

Thank you!

[@mrAmal45]

who else liked this video before watching

[@falgunimehta3060]

I understand the difference between DFS and BFS. However, I get confused when I have to determine which approach should be used. Request you to explain with some examples.

[@rajbhardwaj2180]

U are a btech cs student or MCA ?

[@jyoti149489]

thank you very much for these great videos :)

[@nolimangulabnan6101]

@mycodeschool hoping you to have more tutorials. like object oriented programming in C/C++ or tutorials in C++03/11 etc..

[@kanikagupta7842]

Please make a video on implementation of bfs and dfs

[@AnaWiway]

Thanks for good explain 🙂

[@thinhnguyenvan7003]

This is awesome

[@satyamlnu2798]

Thankyou brother

[@geetaputtappanavar9581]

You are awesome.

[@venpro8705]

Do more videos on DATA STRUCTURES

[@MarcioPuga]

Thanks a lot the lectures!!

[@claudezhao8014]

Thank you!!!

[@avneeshkhanna]

Great explanation! Thanks for the awesome work. However, I have a small doubt. You mentioned space complexity as O(|V| + |E|). But, |E| = |V|^2. Wouldn't this make it O(n^2) space complexity, which is quite costly?

[@dhruvvishwakarma8129]

yes, that in the worst case is true ! but it is not sure that |E| will actually be equal to |V|^2 in each and every case . :)

[@sergiojimenez3445]

please dijkstra and topological sorting

[@sarvodaykumar2723]

Hello dear teacher could you please add video on adding and delete new node/ edge in graph

[@bhavin_kathiriya]

really nice

[@blackberrybbb]

Watching this in 2019🤪🤪🤪

[@usama57926]

thank u bro

[@hubert322]

Keep it up!!!

[@AnsumanMohanty]

How do you check if two vertices are connected (not necessarily adjacent) on a linear time over edge space ?

[@Itsmesam99]

Make a video on traversal of graph..

[@richardnyema4924]

thanks

[@arghyadhar5805]

what do u mean by weight?is is representing the importance or order of the edges?

[@Ru-wy2cb]

mycodeschool PLEASE DO A TUTORIAL ABOUT CURSOR-BASED IMPLEMENTATION (array manipulated like a linked list) :( thank you.....

[@mukulgupta7251]

Kindy upload DFS and BFS videos too Sir!

[@techie052]

sir can you please upload a video of circulary linked list

[@OluwadamilareAdeosun-hv2hh]

we dey

[@StrikingLetsPlayz]

Implement a program in C/C++ with the following specifications:  The program will prompt the user to give an integer n.  The program will create a graph of n vertices and add edges between any two vertices of the graph in a random way (using a random generation function available in C).  Then the program will show the random graph generated to the user in a user friendly way (graphically or show the adjacency matrix of the graph)  Next, the program will compute all cycles of the graph and show to the user the nodes of each cycle.

[@lambda4497]

Do it yourself dummy

[@zachgosteady]

Thank you so much for these videos!

[@Pensive_117]

Take a shot every time he says "graph".

[@pallavipanday9152]

Wow just wow

[@tsalamazing4032]

Quick question (it's not important but still it's a question). You changed the start vertex and end vertex from char* to int but isn't an int more space-costly than a chr variable?

[@mikethompson8279]

int is indeed more space-costly than a char type, but he changed from char* (pointer to a character) to the int type. Pointers' size is typically 32 bits (4 bytes) which are also the typical size of the int data type. So there wasn't any space performance boost in that example. I believe he just showed an alternative way to store an edge list.

[@simpleman1546]

What if the graph consists of labels on the edges instead of weights? Then is this a better solution. Those labels are the relation and might repeat for other node i.e a label might repeat. These labels are necessary and as well as the graph is having nodes in terms of millions or even billions. Then which data structure you suggest and its approach. Any help!!

[@laxman_sangineni]

ty boss

[@kishore9815]

thank you soo much :)

[@NiteshKumar-xm3nq]

can someone suggest some other channel so much similar to this one ?

[@AOPSADIQ]

You will not be able to find a channel like this one bro. It is gold. Btw you can search for Abdul Bari's lectures

[@abhijithnair3078]

Sir, Isn't string data type available only in java and not c++?? Cause in our c++ classes we were taught that strings were implemented in CPP with the help of char arrays or char pointers...

[@siddharth__pandey]

Abhijith R Nair string is their in c++ but not in c

[@ahmadbelhaj1756]

I understand that we store the vertices in dynamic array and neighbors in linked list but I dont know How to iterate over the edges and how do u store them? help please

[@amitkumarbarman6535]

Sir ,your site is not working. Its showing bad gateway.

[@siddharth__pandey]

Yeah.. Was working till December 17.. Now it's not working

[@memporium240]

1:46 he meant to have a pointer as the strings too i think

[@necro1706]

@9:49 how this is a better design than previous one??

[@Manu-wb2uv]

Can't we jut do a binary search in the vertex list so we would just get O(log|e|)?

[@ir2001]

What's the guarantee that the list is sorted? Most graphs are huge and dynamic. Therefore, inserting nodes while keeping the list sorted would simply add up to the cost.

[@Manu-wb2uv]

@@ir2001 We can just use a binary search tree.... Doh. He actually says the same thing in the next lectures :)

[@ir2001]

He told that while teaching Adjacency List which is far more complex than Vertex List. If you are alright in transforming a simple list-like structure of vertex list by using relatively complicated binary search trees then I don't know why you cannot use the Adjacency List instead (Ignoring the use case). Re-visit the lessons and understand the pros and cons of each approach in storing graphs in memory. You may have a better insight then.

[@Manu-wb2uv]

@@ir2001 Yes that was a typo. I mean the Adjacency list not the Vertex List. My mistake.

[@shreyanschhazed8298]

watching in april 2020

[@riyajuneja777]

What's the C code to implement this?

[@amateurbeginner7538]

you are a bosssssss thank you :)

[@ferao0o0o0]

are you angle ??

[@damjanjovanovski5781]

8 is missing in the graph

[@sairohit8201]

those distances are actually correct lol