Uploaded January 2015 | Updated September 2026, 2 weeks ago

---

See complete series on data structures here:
youtube.com/playlist?list=PL2_aWCzGMAwI3W_JlcBbtYTwiQSsOTa6P

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 : youtube.com/watch?v=9C2cpQZVRBA&index=41&list=PL2_aWCzGMAwI3W_JlcBbtYTwiQSsOTa6P

Time Complexity analysis playlist:
youtube.com/playlist?list=PL2_aWCzGMAwI9HK8YPVBjElbLbI3ufctn

For practice problems and more, visit: mycodeschool.com

Like us on Facebook: facebook.com/MyCodeSchool

Follow us on twitter: twitter.com/mycodeschool