Optimal-Path Finding Algorithm: Difference between revisions
Jump to navigation
Jump to search
m (Text replace - "* <B>See:</B>" to "* <B><U>See:</U></B>") |
m (Text replacement - "__NOTOC__ " to "__NOTOC__ ") |
||
| (8 intermediate revisions by the same user not shown) | |||
| Line 1: | Line 1: | ||
An [[Optimal-Path Finding Algorithm]] is an [[Optimization Algorithm]] that can solve a [[optimal-path finding task]]. | |||
* <B | * <B>Context:</U></B> | ||
** It can range from being a [[Shortest Path Identification Algorithm]] to being a [[Longest Path Identification Algorithm]]. | ** It can range from being a [[Shortest Path Identification Algorithm]] to being a [[Longest Path Identification Algorithm]]. | ||
* <B | ** … | ||
* <B>Counter-Example(s):</B> | |||
** [[Graph Centrality Finding Algorithm]], such as [[PageRank Algorithm]]. | ** [[Graph Centrality Finding Algorithm]], such as [[PageRank Algorithm]]. | ||
* <B | * <B>See:</B> [[Dijkstra's Algorithm]], [[Random Walk]]. | ||
---- | ---- | ||
---- | ---- | ||
__NOTOC__ | |||
[[Category:Concept]] | [[Category:Concept]] | ||
Latest revision as of 03:04, 6 January 2023
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.