Not the kind of graph you're thinking of.

So Jennscript's talk at EmpireJS inspired me to give a talk on a more serious Computer Science topic that actually turns out to be super useful and interesting. I had actually forgotten this fact until I retook Algorithm Analysis as the last part of my Masters degree this semester at Columbia.

I will quickly try to cover:

* Ok, seriously, what? Well: G = (V,E) not G = lines and dots
* Dijkstra's algorithm and shortest paths
* Minimum spanning trees _(maybe)_
* I got mad flow (networks) -- Ford-Fulkerson etc. 
* A wild application or two.

Seriously though: graphs are like everything. It's kind of wild. P ≠ NP and whatnot.