a/ziglings
1
0
Fork 0
mirror of https://codeberg.org/andyscott/ziglings.git synced 2024-11-09 11:40:46 -05:00
Code Issues Projects Releases Packages Wiki Activity

Ex 058 separate explanations for clarity

Browse source
This commit is contained in:
Dave Gauer 2021-04-05 11:55:17 -04:00
parent 79cbc99c5f
commit 34eef5bd24
1 changed files with 4 additions and 2 deletions
Show stats Download patch file Download diff file Expand all files Collapse all files

6
exercises/058_quiz7.zig
View file

@ -446,8 +446,10 @@ fn printTrip(trip: []?TripItem) void {
//
// Since we examine all closest paths first before trying further ones
// (thanks to the "todo" queue), we are performing a "Breadth-First
// Search" (BFS). By tracking "lowest cost" paths, we can also say
// that we're performing a "least-cost search".
// Search" (BFS).
//
// By tracking "lowest cost" paths, we can also say that we're
// performing a "least-cost search".
//
// Even more specifically, the Hermit's Notebook most closely
// resembles the Shortest Path Faster Algorithm (SPFA), attributed to