Fix typos in desc of Bellman Ford

PFischbeck · PFischbeck · commit 8e3d611758b8 · 2016-05-22T22:24:59.000+02:00
diff --git a/algorithm/graph_search/bellman_ford/desc.json b/algorithm/graph_search/bellman_ford/desc.json
@@ -1,5 +1,5 @@
 {
-  "BELLMAN_FORD": "The Bellman–Ford algorithm is an algorithm that computes shortest paths from a single source vertex to all of the other vertices in a weighted digraph. It is different from Dijksstra's Shortest Path Algorithm becuase it allows NEGATIVE weights unlike Dijkstra's.",
+  "Bellman-Ford": "The Bellman–Ford algorithm is an algorithm that computes shortest paths from a single source vertex to all of the other vertices in a weighted digraph. It is different from Dijkstra's Shortest Path Algorithm because it allows NEGATIVE weights unlike Dijkstra's.",
   "Applications": [
     "Packet Routing - A variation of BF is used in the Distance vector Routing Protocol"
   ],
@@ -13,4 +13,4 @@
   "files": {
     "shortest_path": "Finding the shortest path"
   }
-}
+}

Original file line number	Diff line number	Diff line change
`@@ -1,5 +1,5 @@`
`1`	`1`	`{`
`2`		`- "BELLMAN_FORD": "The Bellman–Ford algorithm is an algorithm that computes shortest paths from a single source vertex to all of the other vertices in a weighted digraph. It is different from Dijksstra's Shortest Path Algorithm becuase it allows NEGATIVE weights unlike Dijkstra's.",`
	`2`	`+ "Bellman-Ford": "The Bellman–Ford algorithm is an algorithm that computes shortest paths from a single source vertex to all of the other vertices in a weighted digraph. It is different from Dijkstra's Shortest Path Algorithm because it allows NEGATIVE weights unlike Dijkstra's.",`
`3`	`3`	`"Applications": [`
`4`	`4`	`"Packet Routing - A variation of BF is used in the Distance vector Routing Protocol"`
`5`	`5`	`],`
`@@ -13,4 +13,4 @@`
`13`	`13`	`"files": {`
`14`	`14`	`"shortest_path": "Finding the shortest path"`
`15`	`15`	`}`
`16`		`-}`
	`16`	`+}`