Big-O Time Complexity — Measuring algorithm efficiency; Common complexities (best to worst); How to work it out; Space complexity; Tractable vs intractable
Graph and Tree Traversals — Traversing graphs and trees; Breadth-First Search (BFS); Depth-First Search (DFS); BFS vs DFS; Marking visited nodes
Dijkstra's Shortest Path Algorithm — The shortest path problem; How it works; A worked walkthrough (idea); Dijkstra vs A*; Complexity and limits
Graph Algorithms: Dijkstra BFS DFS and A* — Graph Algorithms: Dijkstra, BFS, DFS, and A*