Shortest path if all edges have length 1 (1) Breath first search (BFS) (2) Depth first search (DFS)
Example: (1) Moore's BFS algorithm for shortest path.
--- Complexity of an algorithm --- Issues involved in complexity:
(2) Other examples: