Pathfinding

Pathfinding or pathing is the plotting, by a computer application, of 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 a shortest path on a weighted graph.

See also

• 데이크스트라 알고리즘 (Dijkstra's algorithm)
• Cohen–Sutherland algorithm (Line clipping algorithm)

Favorite site

• Wikipedia (en) Pathfinding에 대한 설명
• Wikipedia (en) Shortest path problem
• Shortest Path Through A Concave Polygon With Holes ¹

References