- Basic representations
- Directed graphs
- Undirected graphs
- Weighted graphs
- Traversal of graphs:
- DFS
- BFS
- Topological sorting:
- Directed acyclic graphs
- Minimum spanning trees:
- Prim’s algorithm
- Kruskal’s algorithm
- Shortest paths:
- Dijkstra’s algorithm
- Bellman-ford algorithm
- A* algorithm (optional)