Antti Laaksonen
Results
3
issues of
Antti Laaksonen
1. 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...
Why does the last subset iteration code work?
The analysis of nim and examples could be improved