Let's first define what exactly the problem is. Take this graph, for instance. For the purposes of this post, the blue circles represent "nodes" or "vertices" and the black lines are "edges" or "node ...

When Edsger W. Dijkstra published his algorithm in 1959, computer networks were barely a thing. The algorithm in question found the shortest path between any two nodes on a graph, with a variant ...

Most of you have used a navigation app like Google Maps for your travels at some point. These apps rely on algorithms that compute shortest paths through vast networks. Now imagine scaling that task ...

One of the most classic algorithmic problems deals with calculating the shortest path between two points. A more complicated variant of the problem is when the route traverses a changing network - ...

What is Open Shortest Path First (OSPF)? Open Shortest Path First (OSPF) is an IP routing protocol that uses a mathematical algorithm to calculate the most efficient path to direct traffic on IP ...

The problem of Micromouse i.e. A Maze Solving Robot is about 32 years old but its importance in the field of Robotics is unparalleled because it requires thorough analysis and paper work. Before it is ...

This post will cover the basics of Dijksta's shortest path algorithm and how it can apply to path finding for game development. It is my opinion that understanding this algorithm will aid in ...