diff options
| author | Dave Gauer <dave@ratfactor.com> | 2021-04-05 11:55:17 -0400 |
|---|---|---|
| committer | Dave Gauer <dave@ratfactor.com> | 2021-04-05 11:55:17 -0400 |
| commit | 34eef5bd242ab8c6de992f4da1c87c1d46a2be22 (patch) | |
| tree | b1c5ce283d32c3b92ba0282acac2e75007a3ddc4 /exercises/058_quiz7.zig | |
| parent | 79cbc99c5f3f0d4ffecc23e700999ebe85046233 (diff) | |
Ex 058 separate explanations for clarity
Diffstat (limited to 'exercises/058_quiz7.zig')
| -rw-r--r-- | exercises/058_quiz7.zig | 6 |
1 files changed, 4 insertions, 2 deletions
diff --git a/exercises/058_quiz7.zig b/exercises/058_quiz7.zig index e567d5a..46d68a8 100644 --- a/exercises/058_quiz7.zig +++ b/exercises/058_quiz7.zig @@ -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 |