diff --git a/doc/dijkstra.md b/doc/dijkstra.md
index 4dec2ab2f3f7a741e754658e6a5c8bb7d81df1db..6ca1c25e7bfc545f33bf1bc122be9564343ba95f 100644
--- a/doc/dijkstra.md
+++ b/doc/dijkstra.md
@@ -5,7 +5,7 @@ Dijktra algorithm
 
 This library provide a C++ implementation of the [Dijkstra algorithm](https://en.wikipedia.org/wiki/Dijkstra%27s_algorithm) to find the lowest cost path between two points.
 
-The function to compute the klowest cost path is called *find_shortest_path* and has the following prototype:
+The function to compute the lowest cost path is called *find_shortest_path* and has the following prototype:
 
 ```
 double find_shortest_path(Eigen::MatrixXd &graph,unsigned int start_node,unsigned int end_node,std::vector<unsigned int> &path)
@@ -23,7 +23,7 @@ If a path to the target node is found, this function will return the total cost
 
 * Create an object of this class.
 * Generate a 2D square matrix representing the connectivity and cost of the desired problem.
-* Select a start and target nodes. With the current implementation, the start node msut always be the first one.
+* Select a start and target nodes. With the current implementation, the start node must always be the first one.
 * Call the *find_shortest_path()* function to get the desired path, if it exists.
 
-An example is provided for a simple case.
\ No newline at end of file
+An example is provided for a simple case.