User:Cyde/todo

This is just a list of some stuff I hope to get around to doing.
 * Add a proof to Dijkstra's algorithm, complete with diagram, and an explanation of where the proof breaks down in the case of allowable negative edges (and negative cycles). Also add a modified algorithm to reconstruct the path taken (if not there already).
 * Add a new page to the Scheduling disambig dealing with scheduling as a topic in algorithm analysis. Talk about interval scheduling and interval partitioning at the very least.
 * Add a proof somewhere that, if the maximum degree of a graph G is d then G is d+1 colorable.