Graph Data Structures: Representing Graphs Using Matrices Lists & Sets

In order to really understand how graphs work it is important to know how they are implemented. There are multiple ways to represent graphs in code and each representation has its own advantages and disadvantages. In this course you will implement graphs using three different representations – the adjacency matrix the adjacency list and the adjacency set. Learn how the adjacency matrix representation uses a square matrix to represent connections between the nodes of a graph and also edge weights. Next explore how the adjacency list suffers from a major drawback: the same graph can have multiple representations. Finally discover how the adjacency set representation has exactly one way in which a graph is represented. When you are finished with this course you will be able to create and work with your own graph structures and optimize them for different purposes.