Shortest Path

A Shortest Path is a graph path that is a optimal graph path (such that the path length[math]\displaystyle{ (v_1, v_2) }[/math] is shorter than any other possible graph path).

• AKA: Shortest Graph Path.
• Context:
  • It can be found by a Shortest Path Identification Task.
  • …
• Counter-Example(s):
  • a Longest Path.
  • a Minimum Spanning Tree.
  • a Straight Line.
  • a Random Walk.
• See: Shortest.

---

---

References

2011

• http://en.wikipedia.org/wiki/Shortest_path_problem
  • QUOTE: ... a path between two vertices (or nodes) in a graph such that the sum of the weights of its constituent edges is minimized.

---