Pathfinding
Plotting, by a computer application, of the shortest route between two points
Pathfinding or pathing is the search, by a computer application, for the shortest route between two points. It is a more practical variant on solving mazes. This field of research is based heavily on Dijkstra's algorithm for finding the shortest path on a weighted graph.
Nº Q1969601 ★
Common · Knowledge
Pathfinding
Plotting, by a computer application, of the shortest route between two points
Pathfinding or pathing is the search, by a computer application, for the shortest route between two points. It is a more practical variant on solving mazes. This field of research is based heavily on Dijkstra's algorithm for finding the shortest path on a weighted graph.
From Wikipedia
Pathfinding or pathing is the search, by a computer application, for the shortest route between two points. It is a more practical variant on solving mazes. This field of research is based heavily on Dijkstra's algorithm for finding the shortest path on a weighted graph. Pathfinding is closely related to the shortest path problem, within graph theory, which examines how to identify the path that best meets some criteria (shortest, cheapest, fastest, etc) between two points in a large network.
Text: Wikipédia, CC BY-SA 4.0. · Image: MistWiz (Public domain) ·
Related cards
-
Dijkstra's algorithm
Graph search algorithm
Nº Q8548 ★★★★
Not listed
-
Path tracing
Computer graphics method
Nº Q72948 ★★
Not listed
-
A* search algorithm
Algorithm used for pathfinding and graph traversal
Nº Q277680 ★★★
Not listed
-
Chinese postman problem
In graph theory, the problem to find a shortest closed path or circuit that visits every edge of an undirected graph
Nº Q901096 ★
Not listed
-
P
Path MTU Discovery
Computer network protocol
Nº Q465141 ★
Not listed
-
Lee algorithm
Algorithm based on breadth-first search to solve mazes
Nº Q4060677 ★
Not listed