From e52d5156dfbee58db037e3cba12aa4393be1b6aa Mon Sep 17 00:00:00 2001 From: Alex Alekseyenko Date: Thu, 31 Jan 2019 13:10:33 -0800 Subject: [PATCH] Fix typo Looks like an extra "are" snuck in there. --- book/book.tex | 2 +- 1 file changed, 1 insertion(+), 1 deletion(-) diff --git a/book/book.tex b/book/book.tex index 98052b39..8a422b9f 100644 --- a/book/book.tex +++ b/book/book.tex @@ -2867,7 +2867,7 @@ \section{Exercises} Of course, one option is to run Dijkstra's algorithm $n$ times, once for each starting node. And for some applications, that's -probably good enough. But there are are more efficient alternatives. +probably good enough. But there are more efficient alternatives. Find an algorithm for the all-pairs shortest path problem and implement it. See