Shortest path problem
Dijkstra’s Algorithm
Tower of Hanoi
Knapsack Problem
Shortest Path Faster Algorithm
Dynamic Programming
Traveling Salesman Problem
Exact Algorithm
Approximate Algorithm
Dining Philosophers
Eight Queens
Two Generals

It's a Small World After All
Shortest path problem
Dijkstra’s Algorithm
Tower of Hanoi
Knapsack Problem
Shortest Path Faster Algorithm
Dynamic Programming
Traveling Salesman Problem
Exact Algorithm
Approximate Algorithm
Dining Philosophers
Eight Queens
Two Generals