diff --git a/docs/src/first_steps/paths_traversal.md b/docs/src/first_steps/paths_traversal.md
index 5cdaca79a..520009286 100644
--- a/docs/src/first_steps/paths_traversal.md
+++ b/docs/src/first_steps/paths_traversal.md
@@ -10,7 +10,7 @@ Any graph traversal will traverse an edge only if it is present in the graph. Wh
 
 1. distance values for undefined edges will be ignored;
 2. any unassigned values (in sparse distance matrices) for edges that are present in the graph will be assumed to take the default value of 1.0;
-3. any zero values (in sparse/dense distance matrices) for edges that are present in the graph will instead have an implicit edge cost of 1.0.
+3. any zero values (in sparse/dense distance matrices) for edges that are present in the graph will instead have an implicit edge cost of 0.0.
 
 ## Graph traversal