For each algorithm assigned, provide psuedocode, including formal description of inputs and outputs, and work out the algorithm on an example of your own devising. Where a theorem or lemma helps explain why the algorithm works, present it as well.
|Strongly-Connected Components||Chan/Jenkins||Present algorithm with example and runtime complexity||DPV Ch. 3, CLRS 22.5|
|Topological Sort||Young/Echavarria||Present algorithm with example and runtime complexity||CLRS 22.4|
|Floyd-Warshall||Corley/Stechmann||Present algorithm with example and runtime complexity||CLRS 25.2|
|Bellman-Ford||Latoya||Present algorithm with example and runtime complexity||DPV 4.6, CLRS 24.1|