Graph Representation part 01 - Edge List

preview_player
Показать описание
See complete series on data structures here:

In this lesson, we have described how we can represent and store a graph in computer's memory as vertex-list and edge-list. We have analyzed the time and space complexities of such a representation.
In next two lessons, we will talk about adjacency matrix and adjacency list representations.

Time Complexity analysis playlist:

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

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

saugatkafley
Автор

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

sanjayakumarsahoo
Автор

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

DarKCremeTai
Автор

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

VaibhavChauhan
Автор

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

every_instant
Автор

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

srjbora
Автор

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

michaelsantos
Автор

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

PawanKumar-tuti
Автор

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.

RaniLink
Автор

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

sserdar
Автор

Such an evergreen tutorial for data structures.

avinashchaurasiya
Автор

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.

anjith
Автор

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.

shreyasbhale
Автор

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

rajnishmaurya
Автор

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

Mariekristienharmsen
Автор

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

priyanshugupta
Автор

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

rajasaad
Автор

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

lokeshsingal
Автор

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

keerthi
Автор

sir please upload the video of Dijkstra's algorithm implementation 

saraswathiseemakurthi