From a7292c7baf49539737136bdf6bc89b4617167c5c Mon Sep 17 00:00:00 2001
From: Saumya Jain <70144862+saumyaj3@users.noreply.github.com>
Date: Fri, 9 Feb 2024 11:20:04 +0100
Subject: [PATCH] Update OneAtATimeIterator.py

saving node_list after sorting
---
 cura/OneAtATimeIterator.py | 2 +-
 1 file changed, 1 insertion(+), 1 deletion(-)

diff --git a/cura/OneAtATimeIterator.py b/cura/OneAtATimeIterator.py
index f92da3ec14f..1017cfc79e9 100644
--- a/cura/OneAtATimeIterator.py
+++ b/cura/OneAtATimeIterator.py
@@ -68,7 +68,7 @@ def _getNodesOrderedAutomatically(hit_checker: HitChecker, node_list: List[CuraS
 
         # Sort the original list so that items that block the most other objects are at the beginning.
         # This does not decrease the worst case running time, but should improve it in most cases.
-        sorted(node_list, key = cmp_to_key(hit_checker.calculateScore))
+        node_list = sorted(node_list, key = cmp_to_key(hit_checker.calculateScore))
 
         todo_node_list = [_ObjectOrder([], node_list)]
         while len(todo_node_list) > 0: