Optimal-Path Finding Algorithm

A 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):
  • Graph Centrality Finding Algorithm, such as PageRank Algorithm.
• See: Dijkstra's Algorithm, Random Walk.

---

---