- Binary Search
- Hash-Based Search
- Sequential Search
-
Dijkstra's Priority Queue Search (weight is equal to neighbor vertices index difference)
-
Prim's Search (weight is equal to neighbor vertices index difference)
-
Floyd-Warshall (weight is equal to neighbor vertices index difference)
- A* Search
- Minimax
- NegMax
- AlphaBeta