Skip to content
Open
Changes from all commits
Commits
File filter

Filter by extension

Filter by extension

Conversations
Failed to load comments.
Loading
Jump to
Jump to file
Failed to load files.
Loading
Diff view
Diff view
2 changes: 1 addition & 1 deletion docs/src/first_steps/paths_traversal.md
Original file line number Diff line number Diff line change
Expand Up @@ -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

Expand Down
Loading