Graphs Representations - Adjacency Lists vs Adjacency Matrix

This video will cover graph representations. Specifically, we will cover the two most common ways of representing a graph when discussing solutions for graph problems in Computer Science.
If you'd like to understand how algorithms like BFS, DFS and more work, then having a good understanding about the representations of graphs is a good first step.

The video will explain both Adjacency Lists and Adjacency Matrix graph representations, with examples on a directed graph and an undirected graph.
Afterwards the video will cover important points by comparing Adjacency Lists vs Adjacency Matrix.
Finally we'll see how to extend these representations to support weights on edges, as an example for other possible extensions that are needed in various graphs problems.

0:00 Introduction
1:30 Types of Graphs
3:10 Adjacency Lists
6:33 Adjacency Matrix
11:25 Adjacency Lists vs Adjacency Matrix
14:40 Edges with weight