v0.1.2: Python 3.8 compatibility and PyPI publication

- Fixed type annotations for Python 3.8 compatibility
- Updated package structure and configuration
- Published to PyPI
- Added comprehensive test suite with 94% coverage
- Updated documentation and badges

Author: berendmarkhorst

.coverage

@@ -7,6 +7,13 @@ and this project adheres to [Semantic Versioning](https://semver.org/spec/v2.0.0
 
 ## [Unreleased]
 
+## [0.1.2] - 2025-12-18
+
+### Fixed
+- Python 3.8 compatibility by replacing modern type annotations (`list[type]`) with `typing.List[Type]`
+- Type annotations throughout the codebase now compatible with Python 3.8+
+- Pytest configuration updated to use correct package name for coverage
+
 ## [0.1.1] - 2025-12-18
 
 ### Fixed

CHANGELOG.md

@@ -1,7 +1,8 @@
 # SteinerPy
 
 [![PyPI version](https://badge.fury.io/py/steinerpy.svg)](https://badge.fury.io/py/steinerpy)
-[![Python 3.8+](https://img.shields.io/badge/python-3.8+-blue.svg)](https://www.python.org/downloads/)
+[![PyPI - Downloads](https://img.shields.io/pypi/dm/steinerpy)](https://pypi.org/project/steinerpy/)
+[![Python 3.8+](https://img.shields.io/pypi/pyversions/steinerpy.svg)](https://pypi.org/project/steinerpy/)
 [![License: MIT](https://img.shields.io/badge/License-MIT-yellow.svg)](https://opensource.org/licenses/MIT)
 [![CI/CD](https://github.com/berendmarkhorst/SteinerPy/workflows/CI%2FCD%20Pipeline/badge.svg)](https://github.com/berendmarkhorst/SteinerPy/actions)
 [![codecov](https://codecov.io/gh/berendmarkhorst/SteinerPy/branch/main/graph/badge.svg)](https://codecov.io/gh/berendmarkhorst/SteinerPy)
@@ -10,7 +11,7 @@ A Python package for solving Steiner Tree and Steiner Forest Problems using the
 
 ## Installation
 
-Install SteinerPy using pip:
+Install SteinerPy from PyPI:
 
 ```bash
 pip install steinerpy
@@ -22,6 +23,12 @@ Or using uv:
 uv add steinerpy
 ```
 
+### Requirements
+
+- Python 3.8+
+- NetworkX
+- HiGHS Solver (via highspy)
+
 ## Quick Start
 
 ```python

README.md

@@ -4,7 +4,7 @@ build-backend = "hatchling.build"
 
 [project]
 name = "steinerpy"
-version = "0.1.1"
+version = "0.1.2"
 description = "Package to solve Steiner Tree and Steiner Forest Problems with the HiGHS solver"
 readme = "README.md"
 license = "MIT"
@@ -96,7 +96,7 @@ testpaths = ["tests"]
 python_files = "test_*.py"
 python_classes = "Test*"
 python_functions = "test_*"
-addopts = "-v --cov=src --cov-report=html --cov-report=term-missing"
+addopts = "-v --cov=steinerpy --cov-report=html --cov-report=term-missing"
 
 [dependency-groups]
 dev = [

pyproject.toml

@@ -1,3 +1,3 @@
 """Version information for SteinerPy."""
 
-__version__ = "0.1.1"
+__version__ = "0.1.2"

steinerpy/_version.py

@@ -1,6 +1,7 @@
 import highspy as hp
 import logging
 import time
+from typing import List, Set, Tuple, Dict
 
 # Configure logging
 logging.basicConfig(level=logging.INFO)
@@ -26,15 +27,15 @@ def make_model(time_limit: float, logfile: str = "") -> hp.HighsModel:
     return model
 
 
-def get_terminals(terminal_group: list[list]) -> list:
+def get_terminals(terminal_group: List[List]) -> List:
     """
     Turns a nested list of terminals into a list of terminals.
     :param terminal_group: nested list of terminals.
     :return: list of terminals.
     """
     return [t for group in terminal_group for t in group]
 
-def terminal_groups_without_root(terminal_group: list[list], roots: list, group_index: int) -> set:
+def terminal_groups_without_root(terminal_group: List[List], roots: List, group_index: int) -> Set:
     """
     Get terminal groups until index k without kth root.
     :param terminal_group: nested list of terminals.
@@ -47,7 +48,7 @@ def terminal_groups_without_root(terminal_group: list[list], roots: list, group_
     else:
         return set()
 
-def get_terminal_groups_until_k(terminal_groups: list[list], group_index: int) -> set:
+def get_terminal_groups_until_k(terminal_groups: List[List], group_index: int) -> Set:
     """
     Get terminal groups until index k.
     :param terminal_groups: nested list of terminals.
@@ -56,7 +57,7 @@ def get_terminal_groups_until_k(terminal_groups: list[list], group_index: int) -
     """
     return set(get_terminals(terminal_groups[:group_index]))
 
-def add_directed_constraints(model: hp.HighsModel, steiner_problem: 'SteinerProblem') -> tuple[hp.HighsModel, dict[hp.HighsVarType]]:
+def add_directed_constraints(model: hp.HighsModel, steiner_problem: 'SteinerProblem') -> Tuple[hp.HighsModel, Dict[str, hp.HighsVarType]]:
     """
     Adds DO-D constraints to the model (see Markhorst et al. 2025)
     :param model: HiGHS model.
@@ -150,7 +151,7 @@ def demand_and_supply_directed(steiner_problem: 'SteinerProblem', group_id_k: in
         return 0
 
 
-def add_flow_constraints(model: hp.HighsModel, steiner_problem: 'SteinerProblem', z: hp.HighsVarType, y2: hp.HighsVarType) -> tuple[hp.HighsModel, dict[hp.HighsVarType]]:
+def add_flow_constraints(model: hp.HighsModel, steiner_problem: 'SteinerProblem', z: hp.HighsVarType, y2: hp.HighsVarType) -> Tuple[hp.HighsModel, Dict[str, hp.HighsVarType]]:
     """
     We add the flow constraints to the HiGHS model.
     :param model: HiGHS model.
@@ -192,7 +193,7 @@ def add_flow_constraints(model: hp.HighsModel, steiner_problem: 'SteinerProblem'
     return model, f
 
 
-def build_model(steiner_problem: 'SteinerProblem', time_limit: float = 300, logfile: str = "") -> tuple[hp.HighsModel, float]:
+def build_model(steiner_problem: 'SteinerProblem', time_limit: float = 300, logfile: str = "") -> Tuple[hp.HighsModel, hp.HighsVarType, hp.HighsVarType, hp.HighsVarType, hp.HighsVarType, Dict[str, hp.HighsVarType]]:
     """
     Returns the deterministic directed model.
     :param steiner_problem: SteinerProblem-object.
@@ -221,7 +222,7 @@ def build_model(steiner_problem: 'SteinerProblem', time_limit: float = 300, logf
     return model, x, y1, y2, z, f
 
 
-def run_model(model: hp.HighsModel, steiner_problem: 'SteinerProblem', x: hp.HighsVarType) -> tuple[float, float, float, list[tuple]]:
+def run_model(model: hp.HighsModel, steiner_problem: 'SteinerProblem', x: hp.HighsVarType) -> Tuple[float, float, float, List[Tuple]]:
     """
     Solves the model and returns the result.
     :param model: highspy model.

steinerpy/mathematical_model.py

@@ -1,9 +1,10 @@
 import networkx as nx
 import highspy as hp
+from typing import List, Tuple
 from .mathematical_model import build_model, run_model
 
 class SteinerProblem:
-    def __init__(self, graph: nx.Graph, terminal_groups: list[list], weight="weight"):
+    def __init__(self, graph: nx.Graph, terminal_groups: List[List], weight="weight"):
         """
         Initialize the SteinerProblem (can be tree or forest).
         :param graph: networkx graph.
@@ -39,7 +40,7 @@ def get_solution(self, time_limit: float = 300, log_file: str = "") -> 'Solution
         return solution
 
 class Solution:
-    def __init__(self, gap: float, runtime: float, objective: float, selected_edges: list[tuple]):
+    def __init__(self, gap: float, runtime: float, objective: float, selected_edges: List[Tuple]):
         self.gap = gap
         self.runtime = runtime
         self.objective = objective