Data Structures and Algorithms - Part One

Djikstra

Djikstra is a pathfinding algorithm which aims to find the shortest path within a network of nodes. The network is comprised of interlinked pathways, where each path connects two nodes.

In a successive process, the neighbouring nodes are compared in order to find the shortest path. For each comparision, the node with the least distance is set to be the current destination. The process then repeats, until the end goal has been reached.

A*

Like the Djikstra algorithm, A* is another pathfinding algorithm. A* makes use of a weighted graph, where each node is assigned a value based on the accumalative distance traveled. Two lists are initialised, an open and closed list. The open lists consists of all nodes which are yet to be processed.