Merge 42b00c3363 into 2c67b48c21

src/algorithms/graph/bellman-ford/bellmanFord.js

@@ -8,7 +8,7 @@ export default function bellmanFord(graph, startVertex) {
   const previousVertices = {};
 
   // Init all distances with infinity assuming that currently we can't reach
-  // any of the vertices except start one.
+  // any of the vertices except start one and try to get to that point.
   distances[startVertex.getKey()] = 0;
   graph.getAllVertices().forEach((vertex) => {
     previousVertices[vertex.getKey()] = null;

src/algorithms/graph/prim/README.md

@@ -1,7 +1,7 @@
 # Prim's Algorithm
 
 In computer science, **Prim's algorithm** is a greedy algorithm that 
-finds a minimum spanning tree for a weighted undirected graph. 
+finds a minimum spanning tree(shortest distance to reach every node) for a weighted undirected graph. 
 
 The algorithm operates by building this tree one vertex at a 
 time, from an arbitrary starting vertex, at each step adding