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 ...

Finding the minimum spanning tree is one of the fundamental algorithms and it is important in computer science and practical programming. We take a look at the theory and the practice. Before we get ...

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 ...

This course will provide a solid foundation and background for the design and analysis of algorithms. In particular, upon successful completion of this course, students will be able to understand, ...

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 ...