aboutsummaryrefslogtreecommitdiff
diff options
context:
space:
mode:
-rw-r--r--portfolio3.md2
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.