Definition and Properties
Graph representations: adjacency matrix, adjacency list.
Types: directed, undirected, weighted, unweighted.
Traversal Algorithms
Breadth-First Search (BFS).
Depth-First Search (DFS).
Example problems: connected components, shortest path (Dijkstra’s algorithm).