Shortest path and minimum spanning tree are for unweighted graphs only

Author: hollance

Minimum Spanning Tree/Images/Graph.png Minimum Spanning Tree (Unweighted)/Images/Graph.png

@@ -1,4 +1,4 @@
-# Minimum Spanning Tree
+# Minimum Spanning Tree (Unweighted Graph)
 
 A minimum spanning tree describes a path that contains the smallest number of edges that are needed to visit every node in the graph.
 

Minimum Spanning Tree/Images/Graph.sketch Minimum Spanning Tree (Unweighted)/Images/Graph.sketch

@@ -169,9 +169,9 @@ Most of the time using just the built-in `Array`, `Dictionary`, and `Set` types
 
 - [Graph](Graph/)
 - [Breadth-First Search (BFS)](Breadth-First Search/)
-- [Depth-First Search (DFS)](Depth-First Search/) :construction:
-- [Shortest Path](Shortest Path/)
-- [Minimum Spanning Tree](Minimum Spanning Tree/)
+- [Depth-First Search (DFS)](Depth-First Search/)
+- [Shortest Path](Shortest Path %28Unweighted%29/) on an unweighted tree
+- [Minimum Spanning Tree](Minimum Spanning Tree %28Unweighted%29/) on an unweighted tree
 - All Paths
 
 ## Puzzles

Minimum Spanning Tree/Images/MinimumSpanningTree.png Minimum Spanning Tree (Unweighted)/Images/MinimumSpanningTree.png

@@ -1,4 +1,4 @@
-# Shortest Path
+# Shortest Path (Unweighted Graph)
 
 Goal: find the shortest route to go from one node to another in a graph.
 
@@ -99,8 +99,4 @@ This will output:
 
 > **Note:** This version of `breadthFirstSearchShortestPath()` does not actually produce the tree, it only computes the distances. See [minimum spanning tree](../Minimum Spanning Tree/) on how you can convert the graph into a tree by removing edges.
 
-## Weighted graph: Dijkstra's algorithm
-
-[Coming soon]
-
 *Written by [Chris Pilcher](https://github.com/chris-pilcher) and Matthijs Hollemans*