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 - "<U>Counter-Example(s):</U>" to "Counter-Example(s):") |
||
| Line 2: | Line 2: | ||
* <B><U>Context:</U></B> | * <B><U>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><U>See:</U></B> [[Dijkstra's Algorithm]], [[Random Walk]]. | * <B><U>See:</U></B> [[Dijkstra's Algorithm]], [[Random Walk]]. | ||
Revision as of 00:23, 21 September 2014
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):
- See: Dijkstra's Algorithm, Random Walk.