A graph is a non-linear data structure that can be looked at as a collection of vertices (or nodes) potentially connected by line segments named **edges**.
An Adjacency matrix is represented through a 2-dimensional array. If there are n vertices, then we are looking at an n x n Boolean matrix
Adjacency List
An adjacency list is the most common way to represent graphs.
An adjacency list is a collection of linked lists or array that lists all of the other vertices that are connected.