Optimal-Path Finding Algorithm
Jump to navigation
Jump to search
An Optimal-Path Finding Algorithm is an Optimization Algorithm that can solve a optimal-path finding task.
- Context:
- It can range from being a Shortest Path Identification Algorithm to being a Longest Path Identification Algorithm.
- …
- Counter-Example(s):
- See: Dijkstra's Algorithm, Random Walk.