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

Jump to bottom

Errors in Chapter 13 #89

Open

pllk opened this issue Feb 9, 2022 · 1 comment

Owner

pllk commented Feb 9, 2022

Page 128. Algorithm outputs for nodes 1 -> 4 distance -5 if undirected and 1 if directed. In both cases, Dijkstra correctly finds path 1>3>4 (but with the wrong distance in undirected). The book says it finds path 1>2>4. Am I missing something?
Page 123 node "6" should be node "5".

diffuse commented May 28, 2022

Confirmed that node 4 is relaxed to 1 by the implementation of Dijkstra's algorithm provided in the book. This appears to be an error. A different graph should probably be used as an example here.
This is addressed by Minor typo - Fix node number for bellman ford example #90

Sign up for free to join this conversation on GitHub. Already have an account? Sign in to comment