Readme corrigendum

Author: awpala

.gitignore

@@ -0,0 +1 @@
+debug.log

README.md

@@ -46,5 +46,5 @@ The objective of this repository is to gain insight into these fundamental conce
 | Graph Algorithms | Depth-First Search | Section 22.3 | (N/A) |
 | Graph Algorithms | Minimum Spanning Tree: Kruskal's Algorithm | Section 23.2 | Disjoint Set |
 | Graph Algorithms | Minimum Spanning Tree: Prim's Algorithm | Section 23.3 | Min Priority Queue |
-| Graph Algorithms | Single-Source Shortest Path: Bellford-Ford Algorithm | Section 24.1 | (N/A) |
+| Graph Algorithms | Single-Source Shortest Path: Bellman-Ford Algorithm | Section 24.1 | (N/A) |
 | Graph Algorithms | Single-Source Shortest Path: Dijkstra's Algorithm | Section 24.3 | Min Priority Queue |