Graph Representation part 01 - Edge List
By mycodeschool
Community Score: 50% | 498.7K views | 11y
0 community ratings: null thumbs up, null thumbs down
See complete series on data structures here: http://www.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 : https://www.youtube.com/watch?v=9C2cpQZVRBA&index=41&list=PL2_aWCzGMAwI3W_JlcBbtYTwiQSsOTa6P Time Complexity analysis playlist: https://www.youtube.com/playlist?list=PL2_aWCzGMAwI9HK8YPVBjElbLbI3ufctn For practice problems and more, visit: http://www.mycodeschool.com Like us on Facebook: https://www.facebook.com/MyCodeSchool Follow us on twitter: https://twitter.com/mycodeschool
Tags: Graph, data structure, algorithm, coding, programming, Graph Theory (Field Of Study), yt:cc=on
More from mycodeschool
- Introduction to programming and programming languages: C Programming Tutorial 01 — Score: 50%
- Graph Representation part 03 - Adjacency List — Score: 50%
- Graph Representation part 02 - Adjacency Matrix — Score: 50%
- Data structures: Properties of Graphs — Score: 50%
- Data structures: Introduction to graphs — Score: 50%
- Know your data type: int - C Programming Tutorial 08 — Score: 50%