Graphs

Vertices and edges, adjacency matrix and list, BFS, DFS and shortest paths.

1. 6.1Graph TerminologyVertices and edges, adjacency, degree, paths, cycles, connected graphs, weighted graphs, and how a tree is a special graph.easy
2. 6.2Adjacency Matrix & Adjacency ListTwo ways to store a graph in memory, what each costs, and when to choose which.medium
3. 6.3Directed GraphsOne-way edges, in-degree and out-degree, directed paths and cycles, and how the matrix and list change.easy
4. 6.4BFS & DFSBreadth-first search with a queue, depth-first search with recursion or a stack, the visited array, and O(V + E).medium