From baf39d7f7dd88e28e202705f4a9cff9f1607da00 Mon Sep 17 00:00:00 2001 From: Alejandro Lopez Gestoso <alopez@iri.upc.edu> Date: Mon, 8 Feb 2021 10:36:00 +0100 Subject: [PATCH] Fixed some typos --- doc/dijkstra.md | 6 +++--- 1 file changed, 3 insertions(+), 3 deletions(-) diff --git a/doc/dijkstra.md b/doc/dijkstra.md index 4dec2ab..6ca1c25 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. -- GitLab