Pathfinding

id: pathfinding-170-16343083
title: Pathfinding
text: 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 between two points in a large network.
brand slug: wiki
category slug: encyclopedia
description: Plotting by a computer application
original url: https://en.wikipedia.org/wiki/Pathfinding
date created: 2005-08-11T02:28:48Z
date modified: 2024-09-01T01:48:20Z
main entity: {"identifier":"Q1969601","url":"https://www.wikidata.org/entity/Q1969601"}
image: {"content_url":"https://upload.wikimedia.org/wikipedia/commons/4/4c/Pathfinding_2D_Illustration.svg","width":1000,"height":800}
fields total: 13
integrity: 16

Related Entries

Explore Next Part