105,774 views 249 on YTPak
512 7

Published on 24 Jan 2015 | over 2 years ago

See complete series on data structures here:
www.youtube.com/playlist

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.

Next Lesson : www.youtube.com/watch

Time Complexity analysis playlist:
www.youtube.com/playlist

For practice problems and more, visit: www.mycodeschool.com

Like us on Facebook: www.facebook.com/MyCodeSchool

Follow us on twitter: twitter.com/mycodeschool

Loading related videos...