| Last time | Next time |
Today:
We continue on the rather simple algorithmic front, with algorithms for finding the shortest distance between two points (on a graph).
A hugely important problem, we focus on a couple of "greedy" algorithms for doing so.
Associated with this is the Minimal Spanning Tree problem, in which we trim out the least cost connected graph (a tree) inside of a graph, which reduces redundancy (but at the expense of resiliance!).