physdes-py 0.8__tar.gz → 0.9__tar.gz

{physdes_py-0.8 → physdes_py-0.9}/CHANGELOG.md

@@ -1,5 +1,23 @@
 # Changelog
 
+## Version 0.9 (2026-10-09)
+
+### Performance
+- **Hot-path allocation & debug-I/O cuts**: `manhattan_arc` drops live `ic()` calls from the DME embedding path (and removes `icecream` from the runtime deps); `congestion_map` guards its demo behind `__main__`; `steiner_forest_grid` uses an iterative `UnionFind.find`, hoists finds 4→2 per edge, indexes `paid` by edge, and replaces O(|F|²) reverse-delete with union-of-paths pruning (~1.7×); `routing_tree` gets a scalar 2D fast path in `_find_insertion_point` and list-join `get_tree_structure` (~4× insertion); `dme_algorithm` precomputes keys and does a single-pass stable partition in `_build_merging_tree` (1.2–1.5×). Output-identical, verified by differential tests. (#10a4e9f)
+
+### Bug Fixes
+- **Unbounded wirelength sentinel**: `insert_terminal_with_steiner` previously ignored the tree's `worst_wirelength` by passing a literal `10**12`; the default is now `float('inf')` and Steiner insertion passes it through, so the unconstrained variant honors any caller-set bound. (#0947827)
+
+### Testing & Code Quality
+- **Temp-cwd isolation for tests**: Added an autouse `_isolate_cwd` fixture so visualization tests' relative-path SVG writes land in pytest's temporary directory instead of the repository root. (#409d422)
+- **New benchmarks**: Added `test_benchmarks.py` (5 benchmarks). (#10a4e9f)
+
+### Code Cleanup
+- **SVG EOF newlines**: Added trailing newlines to the example SVGs and formatted the sources. (#0c698e0)
+
+### Build & CI
+- **Dropped `icecream` runtime dep**: Removed it from `setup.cfg` and `requirements/default.txt`. (#10a4e9f)
+
 ## Version 0.8 (2026-09-04)
 
 ### Features

{physdes_py-0.8/src/physdes_py.egg-info → physdes_py-0.9}/PKG-INFO

@@ -1,6 +1,6 @@
 Metadata-Version: 2.4
 Name: physdes-py
-Version: 0.8
+Version: 0.9
 Summary: Physical Design Python Code
 Home-page: https://github.com/luk036/physdes-py/
 Author: Wai-Shing Luk
@@ -13,7 +13,6 @@ Classifier: Programming Language :: Python
 Description-Content-Type: text/markdown; charset=UTF-8
 Requires-Dist: typing_extensions
 Requires-Dist: mywheel
-Requires-Dist: icecream
 Provides-Extra: testing
 Requires-Dist: setuptools; extra == "testing"
 Requires-Dist: pytest; extra == "testing"

{physdes_py-0.8 → physdes_py-0.9}/alpha10.svg

@@ -68,4 +68,4 @@
 <text x="20" y="140" font-family="Arial" font-size="9">Terminals: 7</text>
 <text x="20" y="155" font-family="Arial" font-size="9">Steiner: 5</text>
 <text x="20" y="170" font-family="Arial" font-size="9">Wirelength: 6379.00</text>
-</svg>
+</svg>

{physdes_py-0.8 → physdes_py-0.9}/alpha12.svg

@@ -64,4 +64,4 @@
 <text x="20" y="140" font-family="Arial" font-size="9">Terminals: 7</text>
 <text x="20" y="155" font-family="Arial" font-size="9">Steiner: 4</text>
 <text x="20" y="170" font-family="Arial" font-size="9">Wirelength: 5867.00</text>
-</svg>
+</svg>

{physdes_py-0.8 → physdes_py-0.9}/alpha14.svg

@@ -60,4 +60,4 @@
 <text x="20" y="140" font-family="Arial" font-size="9">Terminals: 7</text>
 <text x="20" y="155" font-family="Arial" font-size="9">Steiner: 3</text>
 <text x="20" y="170" font-family="Arial" font-size="9">Wirelength: 5854.00</text>
-</svg>
+</svg>

{physdes_py-0.8 → physdes_py-0.9}/alpha8.svg

@@ -64,4 +64,4 @@
 <text x="20" y="140" font-family="Arial" font-size="9">Terminals: 7</text>
 <text x="20" y="155" font-family="Arial" font-size="9">Steiner: 4</text>
 <text x="20" y="170" font-family="Arial" font-size="9">Wirelength: 6928.00</text>
-</svg>
+</svg>

{physdes_py-0.8 → physdes_py-0.9}/alpha9998.svg

@@ -68,4 +68,4 @@
 <text x="20" y="140" font-family="Arial" font-size="9">Terminals: 7</text>
 <text x="20" y="155" font-family="Arial" font-size="9">Steiner: 5</text>
 <text x="20" y="170" font-family="Arial" font-size="9">Wirelength: 6379.00</text>
-</svg>
+</svg>

{physdes_py-0.8 → physdes_py-0.9}/example_route3d_with_constraint_and_keepouts.svg

@@ -62,4 +62,4 @@
 <text x="20" y="140" font-family="Arial" font-size="9">Terminals: 7</text>
 <text x="20" y="155" font-family="Arial" font-size="9">Steiner: 3</text>
 <text x="20" y="170" font-family="Arial" font-size="9">Wirelength: 7239.00</text>
-</svg>
+</svg>

{physdes_py-0.8 → physdes_py-0.9}/example_route3d_with_steiner_and_keepouts.svg

@@ -62,4 +62,4 @@
 <text x="20" y="140" font-family="Arial" font-size="9">Terminals: 7</text>
 <text x="20" y="155" font-family="Arial" font-size="9">Steiner: 3</text>
 <text x="20" y="170" font-family="Arial" font-size="9">Wirelength: 7239.00</text>
-</svg>
+</svg>

{physdes_py-0.8 → physdes_py-0.9}/example_route_with_delay_constraint.svg

@@ -68,4 +68,4 @@
 <text x="20" y="140" font-family="Arial" font-size="9">Terminals: 7</text>
 <text x="20" y="155" font-family="Arial" font-size="9">Steiner: 5</text>
 <text x="20" y="170" font-family="Arial" font-size="9">Wirelength: 6379.00</text>
-</svg>
+</svg>

{physdes_py-0.8 → physdes_py-0.9}/example_route_with_keepouts.svg

@@ -63,4 +63,4 @@
 <text x="20" y="140" font-family="Arial" font-size="9">Terminals: 7</text>
 <text x="20" y="155" font-family="Arial" font-size="9">Steiner: 3</text>
 <text x="20" y="170" font-family="Arial" font-size="9">Wirelength: 6839.00</text>
-</svg>
+</svg>

{physdes_py-0.8 → physdes_py-0.9}/example_route_with_steiner.svg

@@ -60,4 +60,4 @@
 <text x="20" y="140" font-family="Arial" font-size="9">Terminals: 7</text>
 <text x="20" y="155" font-family="Arial" font-size="9">Steiner: 3</text>
 <text x="20" y="170" font-family="Arial" font-size="9">Wirelength: 5854.00</text>
-</svg>
+</svg>

{physdes_py-0.8 → physdes_py-0.9}/example_route_with_steiner_and_keepouts.svg

@@ -63,4 +63,4 @@
 <text x="20" y="140" font-family="Arial" font-size="9">Terminals: 7</text>
 <text x="20" y="155" font-family="Arial" font-size="9">Steiner: 3</text>
 <text x="20" y="170" font-family="Arial" font-size="9">Wirelength: 6839.00</text>
-</svg>
+</svg>

{physdes_py-0.8 → physdes_py-0.9}/example_route_with_steiner_special.svg

@@ -80,4 +80,4 @@
 <text x="20" y="140" font-family="Arial" font-size="9">Terminals: 11</text>
 <text x="20" y="155" font-family="Arial" font-size="9">Steiner: 4</text>
 <text x="20" y="170" font-family="Arial" font-size="9">Wirelength: 36.00</text>
-</svg>
+</svg>

{physdes_py-0.8 → physdes_py-0.9}/neg_specical10.svg

@@ -100,4 +100,4 @@
 <text x="20" y="140" font-family="Arial" font-size="9">Terminals: 11</text>
 <text x="20" y="155" font-family="Arial" font-size="9">Steiner: 9</text>
 <text x="20" y="170" font-family="Arial" font-size="9">Wirelength: 45.00</text>
-</svg>
+</svg>

{physdes_py-0.8 → physdes_py-0.9}/requirements/default.txt

@@ -1,4 +1,3 @@
 decorator>=4.1.0
-icecream>=1.0
 mywheel>=0.2
 typing_extensions>=4.5

{physdes_py-0.8 → physdes_py-0.9}/setup.cfg

@@ -24,7 +24,6 @@ package_dir =
 install_requires = 
 	typing_extensions
 	mywheel
-	icecream
 
 [options.packages.find]
 where = src

{physdes_py-0.8 → physdes_py-0.9}/src/physdes/cts/dme_algorithm.py

@@ -386,23 +386,25 @@ class DMEAlgorithm:
             raise ValueError("Empty node range")
 
         mid = lo + count // 2
-        key_fn = (
-            (lambda n: n.position.xcoord) if vertical else (lambda n: n.position.ycoord)
-        )
 
-        # Median-partition in O(n): like Rust's select_nth_unstable_by / C++ nth_element
         sub = nodes[lo:hi]
-        values = sorted([key_fn(n) for n in sub])
-        median_val = values[len(values) // 2]
-        lt = [n for n in sub if key_fn(n) < median_val]
-        eq = [n for n in sub if key_fn(n) == median_val]
-        gt = [n for n in sub if key_fn(n) > median_val]
-        need = count // 2 - len(lt)
-        if need > 0:
-            lt.extend(eq[:need])
-            eq = eq[need:]
-        gt = eq + gt
-        nodes[lo:hi] = lt + gt
+        keys = (
+            [n.position.xcoord for n in sub]
+            if vertical
+            else [n.position.ycoord for n in sub]
+        )
+        median_val = sorted(keys)[count // 2]
+        lt: List["TreeNode"] = []
+        eq: List["TreeNode"] = []
+        gt: List["TreeNode"] = []
+        for node, value in zip(sub, keys):
+            if value < median_val:
+                lt.append(node)
+            elif value == median_val:
+                eq.append(node)
+            else:
+                gt.append(node)
+        nodes[lo:hi] = lt + eq + gt
 
         left_child = self._build_merging_tree(nodes, not vertical, lo, mid)
         right_child = self._build_merging_tree(nodes, not vertical, mid, hi)

{physdes_py-0.8 → physdes_py-0.9}/src/physdes/manhattan_arc.py

@@ -8,8 +8,6 @@ operations during clock tree synthesis.
 
 from typing import TYPE_CHECKING, Any, Generic, TypeVar, Union
 
-from icecream import ic  # type: ignore
-
 from .generic import min_dist
 from .interval import enlarge
 from .point import Point
@@ -274,7 +272,6 @@ class ManhattanArc(Generic[T1, T2]):
             (700, 550)
         """
         nearest_pt = self.impl.nearest_to(manhattan_arc.impl)
-        ic(nearest_pt)
         return nearest_pt.inv_rotates()
 
     def nearest_point_to(self, other: Point[int, int]) -> Point[Any, Any]:
@@ -295,6 +292,4 @@ class ManhattanArc(Generic[T1, T2]):
         """
 
         ms = ManhattanArc.from_point(other)
-        ic(self)
-        ic(ms)
         return self._nearest_point_to(ms)

{physdes_py-0.8 → physdes_py-0.9}/src/physdes/router/routing_tree.py

@@ -179,7 +179,7 @@ class GlobalRoutingTree:
         self.nodes: dict[str, RoutingNode] = {}
         self.next_steiner_id = 1
         self.next_terminal_id = 1
-        self.worst_wirelength = 1e100
+        self.worst_wirelength = float("inf")
         self.source = self._create_node(NodeType.Source, source_position)
 
     def _create_node(self, node_type: NodeType, pt: Point[Any, Any]) -> "RoutingNode":
@@ -408,7 +408,7 @@ class GlobalRoutingTree:
     def _find_insertion_point(
         self,
         point: Point[Any, Any],
-        allowed_wirelength: int,
+        allowed_wirelength: float,
         keepouts: Optional[List[Point[Interval[int], Interval[int]]]] = None,
     ) -> Tuple[Optional["RoutingNode"], "RoutingNode"]:
         """
@@ -442,7 +442,7 @@ class GlobalRoutingTree:
             >>> tree = GlobalRoutingTree(Point(0, 0))
             >>> _ = tree.insert_terminal_node(Point(10, 0))
             >>> keepouts = [Point(Interval(4, 6), Interval(-1, 1))]
-            >>> parent, nearest = tree._find_insertion_point(Point(5, 5), 10**12, keepouts)
+            >>> parent, nearest = tree._find_insertion_point(Point(5, 5), float("inf"), keepouts)
             >>> nearest.pt
             Point(0, 0)
         """
@@ -454,6 +454,10 @@ class GlobalRoutingTree:
         min_distance = self.worst_wirelength  # initially
         valid_found = False
 
+        px = point.xcoord
+        py = point.ycoord
+        scalar_coords = isinstance(px, (int, float)) and isinstance(py, (int, float))
+
         def traverse(node: "RoutingNode") -> None:
             nonlocal nearest_node
             nonlocal parent_node
@@ -461,30 +465,82 @@ class GlobalRoutingTree:
             nonlocal valid_found
 
             for child in node.children:
-                possible_path = node.pt.hull_with(child.pt)
-                distance = possible_path.min_dist_with(point)
-                nearest_pt = possible_path.nearest_to(point)
-
-                if keepouts is not None:
-                    block = False
-                    path1 = nearest_pt.hull_with(point)
-                    path2 = nearest_pt.hull_with(node.pt)
-                    path3 = nearest_pt.hull_with(child.pt)
-                    for keepout in keepouts:
-                        if (
-                            keepout.contains(nearest_pt)
-                            or keepout.blocks(path1)
-                            or keepout.blocks(path2)
-                            or keepout.blocks(path3)
-                        ):
-                            block = True
-                            break
-                    if block:
-                        continue
-
-                path_length = (
-                    node.path_length + node.pt.min_dist_with(nearest_pt) + distance
-                )
+                if scalar_coords:
+                    nx = node.pt.xcoord
+                    ny = node.pt.ycoord
+                    cx = child.pt.xcoord
+                    cy = child.pt.ycoord
+                    if nx <= cx:
+                        lo_x, hi_x = nx, cx
+                    else:
+                        lo_x, hi_x = cx, nx
+                    if ny <= cy:
+                        lo_y, hi_y = ny, cy
+                    else:
+                        lo_y, hi_y = cy, ny
+                    if px < lo_x:
+                        distance = lo_x - px
+                        qx = lo_x
+                    elif px > hi_x:
+                        distance = px - hi_x
+                        qx = hi_x
+                    else:
+                        distance = 0
+                        qx = px
+                    if py < lo_y:
+                        distance += lo_y - py
+                        qy = lo_y
+                    elif py > hi_y:
+                        distance += py - hi_y
+                        qy = hi_y
+                    else:
+                        qy = py
+                    to_node = abs(nx - qx) + abs(ny - qy)
+                    at_node = qx == nx and qy == ny
+                    at_child = qx == cx and qy == cy
+                    if keepouts:
+                        nearest_pt = Point(qx, qy)
+                        path1 = nearest_pt.hull_with(point)
+                        path2 = nearest_pt.hull_with(node.pt)
+                        path3 = nearest_pt.hull_with(child.pt)
+                        block = False
+                        for keepout in keepouts:
+                            if (
+                                keepout.contains(nearest_pt)
+                                or keepout.blocks(path1)
+                                or keepout.blocks(path2)
+                                or keepout.blocks(path3)
+                            ):
+                                block = True
+                                break
+                        if block:
+                            continue
+                else:
+                    possible_path = node.pt.hull_with(child.pt)
+                    distance = possible_path.min_dist_with(point)
+                    nearest_pt = possible_path.nearest_to(point)
+                    to_node = node.pt.min_dist_with(nearest_pt)
+                    at_node = nearest_pt == node.pt
+                    at_child = nearest_pt == child.pt
+
+                    if keepouts:
+                        block = False
+                        path1 = nearest_pt.hull_with(point)
+                        path2 = nearest_pt.hull_with(node.pt)
+                        path3 = nearest_pt.hull_with(child.pt)
+                        for keepout in keepouts:
+                            if (
+                                keepout.contains(nearest_pt)
+                                or keepout.blocks(path1)
+                                or keepout.blocks(path2)
+                                or keepout.blocks(path3)
+                            ):
+                                block = True
+                                break
+                        if block:
+                            continue
+
+                path_length = node.path_length + to_node + distance
                 update = False
                 if path_length <= allowed_wirelength:
                     if valid_found:
@@ -504,10 +560,10 @@ class GlobalRoutingTree:
 
                 if update:
                     min_distance = distance
-                    if nearest_pt == node.pt:
+                    if at_node:
                         nearest_node = node
                         parent_node = None
-                    elif nearest_pt == child.pt:
+                    elif at_child:
                         nearest_node = child
                         parent_node = None
                     else:  # need to insert steiner point
@@ -565,7 +621,7 @@ class GlobalRoutingTree:
         terminal_node = self._create_node(NodeType.Terminal, point)
 
         parent_node, nearest_node = self._find_insertion_point(
-            point, 10**12, keepouts
+            point, self.worst_wirelength, keepouts
         )
 
         if parent_node is None:
@@ -732,11 +788,15 @@ class GlobalRoutingTree:
         if node is None:
             node = self.source
 
-        result = "  " * level + str(node) + "\n"
-        for child in node.children:
-            result += self.get_tree_structure(child, level + 1)
+        parts: List[str] = []
+
+        def collect(current: "RoutingNode", depth: int) -> None:
+            parts.append("  " * depth + str(current) + "\n")
+            for child in current.children:
+                collect(child, depth + 1)
 
-        return result
+        collect(node, level)
+        return "".join(parts)
 
     def find_path_to_source(self, node_id: str) -> List["RoutingNode"]:
         """Find the path from a node back to the source.

{physdes_py-0.8 → physdes_py-0.9}/src/physdes/steiner_forest/congestion_map.py

@@ -119,11 +119,12 @@ def draw_congestion_map(
     print(f"Congestion map saved to {filename}")
 
 
-grid = [
-    [0, 20, 40, 80, 100],
-    [10, 30, 60, 90, 70],
-    [25, 50, 75, 95, 50],
-    [0, 15, 35, 55, 30],
-]
-
-draw_congestion_map(grid, "my_congestion.svg")
+if __name__ == "__main__":
+    grid = [
+        [0, 20, 40, 80, 100],
+        [10, 30, 60, 90, 70],
+        [25, 50, 75, 95, 50],
+        [0, 15, 35, 55, 30],
+    ]
+
+    draw_congestion_map(grid, "my_congestion.svg")

{physdes_py-0.8 → physdes_py-0.9}/src/physdes/steiner_forest/steiner_forest_grid.py

@@ -43,16 +43,21 @@ class UnionFind:
         """
         Find the representative (root) of the set containing idx.
 
-        Uses path compression to flatten the tree structure for faster future lookups.
+        Uses iterative path compression to flatten the tree structure for
+        faster future lookups.
 
         :param idx: The index to find.
         :type idx: int
         :return: The representative (root) of the set.
         :rtype: int
         """
-        if self.parent[idx] != idx:
-            self.parent[idx] = self.find(self.parent[idx])
-        return self.parent[idx]
+        parent = self.parent
+        root = idx
+        while parent[root] != root:
+            root = parent[root]
+        while parent[idx] != root:
+            parent[idx], idx = root, parent[idx]
+        return root
 
     def union(self, idx1: int, idx2: int) -> bool:
         """
@@ -208,13 +213,12 @@ def steiner_forest_grid(
             if row_idx + 1 < height:
                 edges.append((node, node + width, 1.0))
 
-    paid: Dict[Tuple[int, int], float] = collections.defaultdict(float)
+    paid: List[float] = [0.0] * len(edges)
     F: List[Tuple[int, int, float]] = []  # list of (u, v, c) added in order
 
     while True:
-        # Compute term_root
-        term_root: Dict[int, int] = {term: uf.find(term) for term in all_term}
-        # Check if feasible
+        find = uf.find
+        term_root: Dict[int, int] = {term: find(term) for term in all_term}
         feasible = True
         for source in pair_dict:
             root_source = term_root[source]
@@ -227,12 +231,10 @@ def steiner_forest_grid(
         if feasible:
             break
 
-        # Compute comp_terms
         comp_terms: Dict[int, Set[int]] = collections.defaultdict(set)
         for terminal in all_term:
             comp_terms[term_root[terminal]].add(terminal)
 
-        # Compute active_comps
         active_comps: Set[int] = set()
         for root, terms in comp_terms.items():
             is_active = False
@@ -246,14 +248,15 @@ def steiner_forest_grid(
             if is_active:
                 active_comps.add(root)
 
-        # Find min_delta and chosen edge(s)
         min_delta = float("inf")
-        candidate_es: List[Tuple[int, int, float, Tuple[int, int]]] = []
-        for node_u, node_v, cost in edges:
-            if uf.find(node_u) == uf.find(node_v):
+        chosen_idx = -1
+        chosen_u = chosen_v = 0
+        chosen_c = 0.0
+        for edge_idx, (node_u, node_v, cost) in enumerate(edges):
+            root_u = find(node_u)
+            root_v = find(node_v)
+            if root_u == root_v:
                 continue
-            root_u = uf.find(node_u)
-            root_v = uf.find(node_v)
             num = 0
             if root_u in active_comps:
                 num += 1
@@ -261,29 +264,23 @@ def steiner_forest_grid(
                 num += 1
             if num == 0:
                 continue
-            key = (min(node_u, node_v), max(node_u, node_v))
-            paid_val = paid[key]
+            paid_val = paid[edge_idx]
             if paid_val > cost:
                 continue
-            delta_e = (cost - paid_val) / num if num > 0 else float("inf")
+            delta_e = (cost - paid_val) / num
             if delta_e < min_delta:
                 min_delta = delta_e
-                candidate_es = [(node_u, node_v, cost, key)]
-            elif delta_e == min_delta:
-                candidate_es.append((node_u, node_v, cost, key))
+                chosen_idx = edge_idx
+                chosen_u, chosen_v, chosen_c = node_u, node_v, cost
 
         if min_delta == float("inf"):
             raise ValueError("Graph is not connected or cannot connect pairs")
 
-        # Pick first candidate
-        chosen_u, chosen_v, chosen_c, chosen_key = candidate_es[0]
-
-        # Update paid for all eligible edges
-        for u2, v2, c2 in edges:
-            if uf.find(u2) == uf.find(v2):
+        for edge_idx, (u2, v2, c2) in enumerate(edges):
+            ru2 = find(u2)
+            rv2 = find(v2)
+            if ru2 == rv2:
                 continue
-            ru2 = uf.find(u2)
-            rv2 = uf.find(v2)
             num2 = 0
             if ru2 in active_comps:
                 num2 += 1
@@ -291,39 +288,52 @@ def steiner_forest_grid(
                 num2 += 1
             if num2 == 0:
                 continue
-            key2 = (min(u2, v2), max(u2, v2))
-            paid[key2] += min_delta * num2
-            if paid[key2] > c2 + 1e-6:  # tolerance
-                paid[key2] = c2
+            new_paid = paid[edge_idx] + min_delta * num2
+            if new_paid > c2 + 1e-6:  # tolerance
+                new_paid = c2
+            paid[edge_idx] = new_paid
 
-        # Add chosen edge if not overpaid
-        if paid[chosen_key] >= chosen_c - 1e-6:
+        if paid[chosen_idx] >= chosen_c - 1e-6:
             F.append((chosen_u, chosen_v, chosen_c))
             uf.union(chosen_u, chosen_v)
 
-    # Reverse delete
-    F_pruned: List[Tuple[int, int, float]] = F[:]
-    for idx in range(len(F) - 1, -1, -1):
-        temp_uf = UnionFind(n)
-        for jdx in range(len(F)):
-            if jdx != idx:
-                node_u, node_v, _ = F[jdx]
-                temp_uf.union(node_u, node_v)
-        connected = True
-        for source in sources:
-            for target in pair_dict[source]:
-                if temp_uf.find(source) != temp_uf.find(target):
-                    connected = False
-                    break
-            if not connected:
-                break
-        if connected:
-            del F_pruned[idx]
+    # ``F`` is a forest: every added edge merges two distinct components. The
+    # minimal sub-forest preserving all required pair connections is therefore
+    # the union of the unique paths between each pair, so mark those paths
+    # directly instead of running O(|F|^2) reverse-delete passes that rebuild a
+    # UnionFind per candidate edge.
+    adjacency: Dict[int, List[Tuple[int, int]]] = collections.defaultdict(list)
+    for edge_idx, (node_u, node_v, _cost) in enumerate(F):
+        adjacency[node_u].append((node_v, edge_idx))
+        adjacency[node_v].append((node_u, edge_idx))
+
+    needed: List[bool] = [False] * len(F)
+    for source in sources:
+        parent_edge: Dict[int, int] = {}
+        parent_node: Dict[int, int] = {}
+        visited: Set[int] = {source}
+        stack: List[int] = [source]
+        while stack:
+            node = stack.pop()
+            for neighbor, edge_idx in adjacency[node]:
+                if neighbor not in visited:
+                    visited.add(neighbor)
+                    parent_edge[neighbor] = edge_idx
+                    parent_node[neighbor] = node
+                    stack.append(neighbor)
+        for target in pair_dict[source]:
+            current = target
+            while current != source:
+                edge_idx = parent_edge[current]
+                needed[edge_idx] = True
+                current = parent_node[current]
+
+    F_pruned: List[Tuple[int, int, float]] = [
+        edge for edge_idx, edge in enumerate(F) if needed[edge_idx]
+    ]
 
-    # Compute cost
     total_cost: float = sum(cost for _, _, cost in F_pruned)
 
-    # Identify Steiner nodes
     used_nodes: Set[int] = set()
     for node_u, node_v, _ in F_pruned:
         used_nodes.add(node_u)

{physdes_py-0.8 → physdes_py-0.9/src/physdes_py.egg-info}/PKG-INFO

@@ -1,6 +1,6 @@
 Metadata-Version: 2.4
 Name: physdes-py
-Version: 0.8
+Version: 0.9
 Summary: Physical Design Python Code
 Home-page: https://github.com/luk036/physdes-py/
 Author: Wai-Shing Luk
@@ -13,7 +13,6 @@ Classifier: Programming Language :: Python
 Description-Content-Type: text/markdown; charset=UTF-8
 Requires-Dist: typing_extensions
 Requires-Dist: mywheel
-Requires-Dist: icecream
 Provides-Extra: testing
 Requires-Dist: setuptools; extra == "testing"
 Requires-Dist: pytest; extra == "testing"

{physdes_py-0.8 → physdes_py-0.9}/src/physdes_py.egg-info/SOURCES.txt

@@ -201,6 +201,7 @@ tests/mysvg.css
 tests/pnrpoly.svg
 tests/run_failing_tests.py
 tests/test_alpha.py
+tests/test_benchmarks.py
 tests/test_clk_tree_vis.py
 tests/test_dme_algorithm.py
 tests/test_generic_functions.py