From 5c707814d43e01892dc914ebade37ced45e3ffd2 Mon Sep 17 00:00:00 2001
From: Glenn Hickey <glenn.hickey@gmail.com>
Date: Mon, 29 Jul 2024 09:28:58 -0400
Subject: [PATCH] leave old spanning logic alone

---
 src/cactus/progressive/multiCactusTree.py | 3 +--
 1 file changed, 1 insertion(+), 2 deletions(-)

diff --git a/src/cactus/progressive/multiCactusTree.py b/src/cactus/progressive/multiCactusTree.py
index 37f81a4c2..a4cb06717 100644
--- a/src/cactus/progressive/multiCactusTree.py
+++ b/src/cactus/progressive/multiCactusTree.py
@@ -94,8 +94,7 @@ def extractSpanningTree(self, nodes, root_id=None):
             # this is a simple star tree, don't need path-finding logic below which doesn't scale to giant trees
             nodesToInclude = nodeIds + [root_id]
         else:
-            sourceId = root_id if root_id is not None else nodeIds[0]
-            paths = [dijkstra_path(self.nxDg.to_undirected(), source=sourceId, target=x) for x in nodeIds[1:]]
+            paths = [dijkstra_path(self.nxDg.to_undirected(), source=nodeIds[0], target=x) for x in nodeIds[1:]]
             nodesToInclude = set()
             for path in paths:
                 for node in path: