aboutsummaryrefslogtreecommitdiff
path: root/exercises
diff options
context:
space:
mode:
authorDave Gauer <dave@ratfactor.com>2021-04-05 11:55:17 -0400
committerDave Gauer <dave@ratfactor.com>2021-04-05 11:55:17 -0400
commit74221f2fb2f32b52e51ffe1af4572a8940229b96 (patch)
treeb1c5ce283d32c3b92ba0282acac2e75007a3ddc4 /exercises
parent412afe8c38ce25a31e0d6db13b09eb4ebb20e683 (diff)
downloadziglings-74221f2fb2f32b52e51ffe1af4572a8940229b96.tar.gz
ziglings-74221f2fb2f32b52e51ffe1af4572a8940229b96.tar.bz2
ziglings-74221f2fb2f32b52e51ffe1af4572a8940229b96.tar.xz
ziglings-74221f2fb2f32b52e51ffe1af4572a8940229b96.zip
Ex 058 separate explanations for clarity
Diffstat (limited to 'exercises')
-rw-r--r--exercises/058_quiz7.zig6
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