Skip to content
ILya Hadleuski edited this page Sep 17, 2020 · 7 revisions

Welcome to the PathFinding wiki!

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. There are many pathfinding algorithms, the most popular are:

  1. Lee algorithm
  2. Dijkstra's algorithm
  3. A* algorithm

Pathfinding is used in video games, navigating, in net technologies and PCB routing

Home page

Pathfinding

Graph theory

  • Undirected graph
  • Directed graph
Clone this wiki locally