jeffgerickson / algorithms

Bug-tracking for Jeff's algorithms book, notes, etc.
7.88k stars 1.02k forks source link

[Oops.] Typo in proof of WhateverFirstSearch(s) in chp 5 #268

Open funmise opened 1 year ago

funmise commented 1 year ago

Please verify that the error is present in the most recent revision before reporting.

Chapter number or note title: 5

Page number: 200

Error description: it says "The prefix path s→...→u is shorter than the shortest path from s to u". I believe this is supposed to be "s→...→v" as I don't see how the original statement would work but I might be misunderstanding.

Suggested fix (if any): [fix] change "u" to "v" in "s→...→u"