From 5cb76ee9dd1f3a815d3c1f66b1a064e5ce71d883 Mon Sep 17 00:00:00 2001 From: Jonas Smedegaard Date: Thu, 1 May 2025 03:05:02 +0200 Subject: rephrase final sentence about randomness --- portfolio3.md | 2 +- 1 file changed, 1 insertion(+), 1 deletion(-) 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. -- cgit v1.2.3