Shortest path problem, the minimum length of a path between two points in a graph
List of United Kingdom MPs with the shortest service | Year 2000 problem | Thames Path | Waring's problem | The Final Problem | Star Wars: Darth Bane: Path of Destruction | Path integral formulation | path integral formulation | The Problem with Popplers | Hume and the Problem of Causation | flare path | Dirichlet problem | Boolean satisfiability problem | The Dog Problem | Tammes problem | Sussex Border Path | Species problem | problem solving | Problem gambling | Path to the Draft | Packing problem | packing problem | Honea Path, South Carolina | Halima's Path | Elastic Path | chess problem | Znám's problem | Year 10,000 problem | Yamabe problem | World Trade Center (PATH station) |
The Euclidean shortest path problem is a problem in computational geometry: given a set of polyhedral obstacles in a Euclidean space, and two points, find the shortest path between the points that does not intersect any of the obstacles.
Therefore, the Euclidean shortest path problem may be decomposed into two simpler subproblems: constructing the visibility graph, and applying a shortest path algorithm such as Dijkstra's algorithm to the graph.