New Blog Articles

by Kiel Williams


For a general graph with an arbitrary number of nodes and edges, it's usually not obvious what the shortest path is between two nodes. Dijkstra's algorithm is a famous method for systematically determining the length of that shortest path. I explore how to implement this algorithm for a simple graph in 2D, and show how it still works even if the path is subject to some simple constraints. Read More ›

More Articles


Every week, one of us will learn an algorithm, present and leave a brief summay at this altar.

More ›


We meet every other Thusday from 5:00-6:00 pm CST in NCSA 2100.

More ›


We will archive covered algorithms here, as well as post potentially interesting algorithms to be covered.

More ›