Merge remote-tracking branch 'refs/remotes/origin/master'

chrisw7 · chrisw7 · commit 16ee64fb7c37 · 2018-10-01T19:27:53.000-04:00
diff --git a/index.md b/index.md
@@ -186,4 +186,4 @@ For our topological sort algorithm, if, in addition to the in-degree, we use arr
 - if the new critical time exceeds the critical time of any vertices adjacent to the popped (source) vertex, replace those neighbours' critical time with the new critical time and point their previous task to the popped vertex
 the order of the topological sort will also be the shortest critical path of the DAG.
 
-### Minimum Spanning Trees and Shortest-path Algorithms
+### Minimum Spanning Trees and Shortest-path Algorithms
