Skip to content

Fix typo (too many "are"s) #52

New issue

Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.

Sign up for GitHub

By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.

Already on GitHub? Sign in to your account

Open
alexalekseyenko wants to merge 1 commit into
base: master
Choose a base branch
from
Open

Fix typo (too many "are"s) #52

Changes from all commits
Commits
Show all changes
1 commit
Select commit
File filter

Filter by extension

Filter by extension
Conversations
Failed to load comments.
Loading
Jump to
Jump to file
Failed to load files.
Loading
Diff view
Diff view
2 changes: 1 addition & 1 deletion book/book.tex
View file
Open in desktop
Original file line number Diff line number Diff line change
Expand Up @@ -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
Expand Down