diff options
| author | Jonas Smedegaard <dr@jones.dk> | 2025-05-01 03:05:02 +0200 |
|---|---|---|
| committer | Jonas Smedegaard <dr@jones.dk> | 2025-05-01 03:05:02 +0200 |
| commit | 5cb76ee9dd1f3a815d3c1f66b1a064e5ce71d883 (patch) | |
| tree | 21a7f2a78c8ce8521ce8adf19a28782846267f6c | |
| parent | fe979501b69f762db8f20905206c7555d83b620f (diff) | |
rephrase final sentence about randomness
| -rw-r--r-- | portfolio3.md | 2 |
1 files changed, 1 insertions, 1 deletions
diff --git a/portfolio3.md b/portfolio3.md index 087d39e..98d46d3 100644 --- a/portfolio3.md +++ b/portfolio3.md @@ -65,4 +65,4 @@ to find lower path costs. The solution() function simply shuffles the list of vertices of the original h and gets the weight between edges in the list incrementally. It hits no vertex more than once, -and the shuffling makes it a new attempt each time. +and the shuffling makes it quite likely a new attempt each time. |