commit eb36e8a902d2432ae525f28f5c779d12e9bbe6ba parent e321591de625cda5199123a3293a9c7a60fd5aa9 Author: Samir Parikh <noreply@samirparikh.com> Date: Thu, 30 Dec 2021 22:40:22 +0000 update comments Diffstat:
| M | dijkstra.pl | | | 4 | ++-- |
1 file changed, 2 insertions(+), 2 deletions(-)
diff --git a/dijkstra.pl b/dijkstra.pl @@ -1,8 +1,8 @@ #!/usr/local/bin/perl # -# implementation of Dijkstra's algorithm to find the shorted path of weighted -# graphs, as demonstrated in Chapter 7 of "Grokking Algorithms" +# implementation of Dijkstra's algorithm to find the shortest path of +# weighted graphs, as demonstrated in Chapter 7 of "Grokking Algorithms" # https://www.manning.com/books/grokking-algorithms # # In this example, variables holding the hashes for the graph, costs and