bw-graph-tools 0.3__tar.gz → 0.4__tar.gz

{bw_graph_tools-0.3 → bw_graph_tools-0.4}/LICENSE

@@ -1,4 +1,4 @@
-Copyright 2023 Chris Mutel
+Copyright 2024 Chris Mutel
 
 Redistribution and use in source and binary forms, with or without modification, are permitted provided that the following conditions are met:
 

{bw_graph_tools-0.3 → bw_graph_tools-0.4}/PKG-INFO

@@ -1,43 +1,44 @@
 Metadata-Version: 2.1
 Name: bw_graph_tools
-Version: 0.3
+Version: 0.4
 Summary: Graph traversal class and utilities
-Home-page: https://github.com/brightway-lca/bw_graph_tools
-Author: Chris Mutel
-Author-email: <cmutel@gmail.com>
-Maintainer: Chris Mutel
-Maintainer-email: <cmutel@gmail.com>
-License: BSD-3-Clause
+Author-email: Chris Mutel <cmutel@gmail.com>
+Maintainer-email: Chris Mutel <cmutel@gmail.com>
 Project-URL: source, https://github.com/brightway-lca/bw_graph_tools
 Project-URL: homepage, https://github.com/brightway-lca/bw_graph_tools
 Project-URL: tracker, https://github.com/brightway-lca/bw_graph_tools/issues
-Keywords: "brightway","development"
-Platform: any
-Classifier: Development Status :: 4 - Beta
+Classifier: Development Status :: 5 - Production/Stable
 Classifier: Programming Language :: Python
 Classifier: Programming Language :: Python :: 3
+Classifier: Programming Language :: Python :: 3.9
 Classifier: Programming Language :: Python :: 3.10
 Classifier: Programming Language :: Python :: 3.11
-Requires-Python: >=3.8
-Description-Content-Type: text/markdown; charset=UTF-8
+Classifier: Programming Language :: Python :: 3.12
+Classifier: Natural Language :: English
+Classifier: Operating System :: OS Independent
+Classifier: Topic :: Scientific/Engineering
+Requires-Python: >=3.9
+Description-Content-Type: text/markdown
 License-File: LICENSE
 Requires-Dist: bw2calc>=2.0.dev13
+Requires-Dist: bw_processing
 Requires-Dist: matrix_utils
-Requires-Dist: numpy
+Requires-Dist: numpy<2
 Requires-Dist: scipy
-Requires-Dist: bw_processing
 Provides-Extra: testing
-Requires-Dist: setuptools; extra == "testing"
+Requires-Dist: bw_graph_tools; extra == "testing"
+Requires-Dist: bw2data; extra == "testing"
 Requires-Dist: pytest; extra == "testing"
 Requires-Dist: pytest-cov; extra == "testing"
-Requires-Dist: bw2data>=4.0.dev18; extra == "testing"
+Requires-Dist: python-coveralls; extra == "testing"
 Provides-Extra: dev
+Requires-Dist: build; extra == "dev"
 Requires-Dist: pre-commit; extra == "dev"
 Requires-Dist: pylint; extra == "dev"
-Provides-Extra: docs
-Requires-Dist: sphinx; extra == "docs"
-Requires-Dist: myst_parser; extra == "docs"
-Requires-Dist: furo; extra == "docs"
+Requires-Dist: pytest; extra == "dev"
+Requires-Dist: pytest-cov; extra == "dev"
+Requires-Dist: pytest-randomly; extra == "dev"
+Requires-Dist: setuptools; extra == "dev"
 
 # bw_graph_tools
 
@@ -85,7 +86,6 @@ Normally we construct matrices and solve the resulting set of linear equations t
 If we add temporal information using `bw_temporalis`, then the same node can occur at different times depending on how the temporal dynamics its preceding path. For example:
 
 
-
 ## Contributing
 
 Contributions are very welcome.
@@ -103,15 +103,9 @@ please [file an issue] along with a detailed description.
 
 ## Documentation
 
-1. Install the `sphinx-furo` conda environment from the file `.docs/environment.yml`.
-2. Build the documentation locally by running
+1. Install the conda environment from the file `.docs/environment.yml`
+2. Build the documentation locally by running:
 
-```
+```bash
 sphinx-autobuild docs _build/html -a -j auto --open-browser
 ```
-
-<!-- github-only -->
-
-[command-line reference]: https://bw_graph_tools.readthedocs.io/en/latest/usage.html
-[license]: https://github.com/brightway-lca/bw_graph_tools/blob/main/LICENSE
-[contributor guide]: https://github.com/brightway-lca/bw_graph_tools/blob/main/CONTRIBUTING.md

{bw_graph_tools-0.3 → bw_graph_tools-0.4}/README.md

@@ -44,7 +44,6 @@ Normally we construct matrices and solve the resulting set of linear equations t
 If we add temporal information using `bw_temporalis`, then the same node can occur at different times depending on how the temporal dynamics its preceding path. For example:
 
 
-
 ## Contributing
 
 Contributions are very welcome.
@@ -62,15 +61,9 @@ please [file an issue] along with a detailed description.
 
 ## Documentation
 
-1. Install the `sphinx-furo` conda environment from the file `.docs/environment.yml`.
-2. Build the documentation locally by running
+1. Install the conda environment from the file `.docs/environment.yml`
+2. Build the documentation locally by running:
 
-```
+```bash
 sphinx-autobuild docs _build/html -a -j auto --open-browser
-```
-
-<!-- github-only -->
-
-[command-line reference]: https://bw_graph_tools.readthedocs.io/en/latest/usage.html
-[license]: https://github.com/brightway-lca/bw_graph_tools/blob/main/LICENSE
-[contributor guide]: https://github.com/brightway-lca/bw_graph_tools/blob/main/CONTRIBUTING.md
+```

{bw_graph_tools-0.3 → bw_graph_tools-0.4}/bw_graph_tools/__init__.py

@@ -11,9 +11,8 @@ __all__ = (
     "to_normalized_adjacency_matrix",
 )
 
-from .graph_traversal_utils import get_path_from_matrix, path_as_brightway_objects
-from .matrix_tools import guess_production_exchanges, to_normalized_adjacency_matrix
-from .utils import get_version_tuple
+__version__ = "0.4"
+
 from .graph_traversal import (
     AssumedDiagonalGraphTraversal,
     Edge,
@@ -21,5 +20,5 @@ from .graph_traversal import (
     NewNodeEachVisitGraphTraversal,
     Node,
 )
-
-__version__ = get_version_tuple()
+from .graph_traversal_utils import get_path_from_matrix, path_as_brightway_objects
+from .matrix_tools import guess_production_exchanges, to_normalized_adjacency_matrix

{bw_graph_tools-0.3 → bw_graph_tools-0.4}/bw_graph_tools/graph_traversal.py

@@ -2,11 +2,12 @@ import warnings
 from dataclasses import dataclass
 from functools import lru_cache
 from heapq import heappop, heappush
+from typing import Optional
 
-from bw2calc import LCA
-from scipy.sparse import spmatrix
 import matrix_utils as mu
 import numpy as np
+from bw2calc import LCA
+from scipy.sparse import spmatrix
 
 try:
     from bw2data import databases
@@ -70,9 +71,15 @@ class Node:
     supply_amount : float
         The amount of the *activity* (not reference product!) needed to supply the demand from the requesting supply chain edge.
     cumulative_score : float
-        Total LCIA score attributed to `supply_amount` of this activity. Includes direct emissions unless explicitly removed.
+        Total LCIA score attributed to `supply_amount` of this activity, including impacts from direct emissions.
     direct_emissions_score : float
         Total LCIA score attributed only to the direct characterized biosphere flows of `supply_amount` of this activity.
+    direct_emissions_score_outside_specific_flows : float
+        The score attributable to *direct emissions* of this node which isn't broken out into separate `Flow` objects.
+    remaining_cumulative_score_outside_specific_flows : float
+        The *cumulative* score of this node, including direct emissions, which isn't broken out into separate `Flow` objects.
+    terminal : bool
+        Boolean flag indicating whether graph traversal was cutoff at this node
 
     """
 
@@ -85,6 +92,9 @@ class Node:
     supply_amount: float
     cumulative_score: float
     direct_emissions_score: float
+    direct_emissions_score_outside_specific_flows: float = 0.0
+    remaining_cumulative_score_outside_specific_flows: float = 0.0
+    terminal: bool = False
 
     def __lt__(self, other):
         # Needed for sorting
@@ -176,13 +186,13 @@ class NewNodeEachVisitGraphTraversal:
     def calculate(
         cls,
         lca_object: LCA,
-        cutoff: float | None = 5e-3,
-        biosphere_cutoff: float | None = 1e-4,
-        max_calc: int | None = 1e5,
-        skip_coproducts: bool | None = False,
-        separate_biosphere_flows: bool | None = True,
-        static_activity_indices: set[int] | None = set(),
-        functional_unit_unique_id: int | None = -1,
+        cutoff: Optional[float] = 5e-3,
+        biosphere_cutoff: Optional[float] = 1e-4,
+        max_calc: Optional[int] = 10000,
+        skip_coproducts: Optional[bool] = False,
+        separate_biosphere_flows: Optional[bool] = True,
+        static_activity_indices: Optional[set[int]] = set(),
+        functional_unit_unique_id: Optional[int] = -1,
     ) -> dict:
         """
         Priority-first traversal (i.e. follow the past of highest score) of the supply chain graph. This class unrolls
@@ -240,8 +250,8 @@ class NewNodeEachVisitGraphTraversal:
             traverse
         functional_unit_unique_id : int
             An integer id we can use for the functional unit virtual activity.
-            Shouldn't overlap any other activity ids. Don't change unless you r
-            eally know what you are doing.
+            Shouldn't overlap any other activity ids. Don't change unless you
+            really know what you are doing.
 
         Returns
         -------
@@ -257,8 +267,7 @@ class NewNodeEachVisitGraphTraversal:
         biosphere_cutoff_score = abs(total_score * biosphere_cutoff)
         technosphere_matrix = lca_object.technosphere_matrix
         production_exchange_mapping = {
-            x: y
-            for x, y in zip(*cls.get_production_exchanges(lca_object.technosphere_mm))
+            x: y for x, y in zip(*cls.get_production_exchanges(lca_object.technosphere_mm))
         }
         heap, edges, flows = [], [], []
         calculation_count = Counter()
@@ -282,9 +291,7 @@ class NewNodeEachVisitGraphTraversal:
         cls.traverse_edges(
             consumer_index=functional_unit_unique_id,
             consumer_unique_id=functional_unit_unique_id,
-            product_indices=[
-                lca_object.dicts.product[key] for key in lca_object.demand
-            ],
+            product_indices=[lca_object.dicts.product[key] for key in lca_object.demand],
             product_amounts=lca_object.demand.values(),
             lca=lca_object,
             calculation_count=calculation_count,
@@ -323,6 +330,11 @@ class NewNodeEachVisitGraphTraversal:
 
         flows.sort(reverse=True)
 
+        non_terminal_nodes = {edge.consumer_unique_id for edge in edges}
+        for node_id_key in nodes:
+            if node_id_key not in non_terminal_nodes:
+                nodes[node_id_key].terminal = True
+
         return {
             "nodes": nodes,
             "edges": edges,
@@ -461,9 +473,7 @@ class NewNodeEachVisitGraphTraversal:
 
             supply = caching_solver(product_index, product_amount)
             cumulative_score = float((characterized_biosphere * supply).sum())
-            reference_product_net_production_amount = matrix[
-                product_index, producer_index
-            ]
+            reference_product_net_production_amount = matrix[product_index, producer_index]
             scale = product_amount / reference_product_net_production_amount
 
             if abs(cumulative_score) < cutoff_score:
@@ -473,16 +483,12 @@ class NewNodeEachVisitGraphTraversal:
                 unique_id=next(calculation_count),
                 activity_datapackage_id=lca.dicts.activity.reversed[producer_index],
                 activity_index=producer_index,
-                reference_product_datapackage_id=lca.dicts.product.reversed[
-                    product_index
-                ],
+                reference_product_datapackage_id=lca.dicts.product.reversed[product_index],
                 reference_product_index=product_index,
                 reference_product_production_amount=reference_product_net_production_amount,
                 supply_amount=scale,
                 cumulative_score=cumulative_score,
-                direct_emissions_score=(
-                    scale * characterized_biosphere[:, producer_index]
-                ).sum(),
+                direct_emissions_score=(scale * characterized_biosphere[:, producer_index]).sum(),
             )
             edges.append(
                 Edge(
@@ -496,13 +502,22 @@ class NewNodeEachVisitGraphTraversal:
             )
 
             if separate_biosphere_flows:
-                cls.add_biosphere_flows(
+                flow_score = cls.add_biosphere_flows(
                     flows=flows,
                     matrix=(scale * characterized_biosphere[:, producer_index]).tocoo(),
                     lca=lca,
                     node=producing_node,
                     biosphere_cutoff_score=biosphere_cutoff_score,
                 )
+            else:
+                flow_score = 0
+
+            producing_node.direct_emissions_score_outside_specific_flows = (
+                producing_node.direct_emissions_score - flow_score
+            )
+            producing_node.remaining_cumulative_score_outside_specific_flows = (
+                producing_node.cumulative_score - flow_score
+            )
 
             heappush(heap, (abs(1 / cumulative_score), producing_node))
             nodes[producing_node.unique_id] = producing_node
@@ -529,9 +544,7 @@ class NewNodeEachVisitGraphTraversal:
         return lca.characterization_matrix * lca.biosphere_matrix
 
     @classmethod
-    def get_production_exchanges(
-        cls, mapped_matrix: mu.MappedMatrix
-    ) -> (np.array, np.array):
+    def get_production_exchanges(cls, mapped_matrix: mu.MappedMatrix) -> (np.array, np.array):
         """
         Get matrix row and column indices of productions exchanges by trying a
         series of heuristics. See documentation for
@@ -563,7 +576,7 @@ class NewNodeEachVisitGraphTraversal:
         lca: LCA,
         node: Node,
         biosphere_cutoff_score: float,
-    ) -> None:
+    ) -> float:
         """
         Add individual biosphere flows as `Flow` instances to `flow` if their score is above `biosphere_cutoff_score`.
 
@@ -582,12 +595,13 @@ class NewNodeEachVisitGraphTraversal:
 
         Returns
         -------
-        `None`
-            Modifies `flows` by adding new `Flow` instances
+        The total LCIA score broken out to separate `Flow` instances
 
         """
+        added_score = 0.0
         for index, score in zip(matrix.row, matrix.data):
             if abs(score) > biosphere_cutoff_score:
+                added_score += score
                 flows.append(
                     Flow(
                         flow_datapackage_id=lca.dicts.biosphere.reversed[index],
@@ -596,12 +610,12 @@ class NewNodeEachVisitGraphTraversal:
                         activity_id=node.activity_datapackage_id,
                         activity_index=node.activity_index,
                         amount=(
-                            lca.biosphere_matrix[index, node.activity_index]
-                            * node.supply_amount
+                            lca.biosphere_matrix[index, node.activity_index] * node.supply_amount
                         ),
                         score=score,
                     )
                 )
+        return added_score
 
     @classmethod
     def get_demand_vector_for_activity(
@@ -648,9 +662,7 @@ class NewNodeEachVisitGraphTraversal:
 
 class AssumedDiagonalGraphTraversal(NewNodeEachVisitGraphTraversal):
     @classmethod
-    def get_production_exchanges(
-        cls, mapped_matrix: mu.MappedMatrix
-    ) -> (np.ndarray, np.ndarray):
+    def get_production_exchanges(cls, mapped_matrix: mu.MappedMatrix) -> (np.ndarray, np.ndarray):
         """
         Assume production exchanges are always on the diagonal instead of
         examining matrix structure and input data.

{bw_graph_tools-0.3 → bw_graph_tools-0.4}/bw_graph_tools/graph_traversal_utils.py

@@ -60,10 +60,7 @@ def path_as_brightway_objects(
         (
             bd.get_node(id=lca.dicts.product.reversed[x]),
             bd.get_node(id=lca.dicts.activity.reversed[y]),
-            -1
-            * lca.technosphere_matrix[
-                y, x
-            ],  # Flip x and y because y is input to activity x
+            -1 * lca.technosphere_matrix[y, x],  # Flip x and y because y is input to activity x
         )
         for x, y in zip(path[:-1], path[1:])
     ]

{bw_graph_tools-0.3 → bw_graph_tools-0.4}/bw_graph_tools/matrix_tools.py

@@ -67,8 +67,24 @@ def gpe_first_heuristic(mm: mu.MappedMatrix) -> Tuple[np.ndarray, np.ndarray]:
         # Need to check the original input values, not after mapping when they are
         # normalized to [0, X] range.
         ident_mask = indices["row"] == indices["col"]
-        row_mapped = group.row_mapper.map_array(indices["row"][ident_mask])
-        col_mapped = group.col_mapper.map_array(indices["col"][ident_mask])
+
+        # In theory these values should be on the diagonal, as the input row and col
+        # values are the same. However, we don't have a strong guarantee that this is
+        # true. So to eliminate duplicate values we combine to a (X, 2) array, and get
+        # unique rows.
+        # Note that `unique` also does sorting, see
+        # https://stackoverflow.com/questions/16970982/find-unique-rows-in-numpy-array
+        combined = np.unique(
+            np.vstack(
+                (
+                    group.row_mapper.map_array(indices["row"][ident_mask]),
+                    group.col_mapper.map_array(indices["col"][ident_mask]),
+                )
+            ),
+            axis=1,
+        )
+        row_mapped = combined[0, :]
+        col_mapped = combined[1, :]
 
         if (row_mapped == -1).sum() or (col_mapped == -1).sum():
             ERROR = """
@@ -116,9 +132,7 @@ def gpe_second_heuristic(
             existing_mask = np.in1d(h2_col_indices, col_existing)
 
             # Need mask with correct shape for both row and col indices
-            mask = np.in1d(
-                group.col_masked[~group.flip], h2_col_indices[~existing_mask]
-            )
+            mask = np.in1d(group.col_masked[~group.flip], h2_col_indices[~existing_mask])
 
             not_flipped.append(
                 (
@@ -184,9 +198,7 @@ def guess_production_exchanges(mm: mu.MappedMatrix) -> Tuple[np.ndarray, np.ndar
     # Every column must have an activity with some reference product or the system
     # is not solvable. Therefore we can look across all columns. We will do
     # all the work in matrix indices.
-    missing = np.setdiff1d(
-        np.arange(mm.matrix.shape[0]), col_indices, assume_unique=True
-    )
+    missing = np.setdiff1d(np.arange(mm.matrix.shape[0]), col_indices, assume_unique=True)
 
     # Short circuit other steps if possible; assumption is that this step will
     # be taken for most matrices
@@ -200,9 +212,7 @@ def guess_production_exchanges(mm: mu.MappedMatrix) -> Tuple[np.ndarray, np.ndar
     if row_indices.shape != col_indices.shape:
         raise ValueError("Guessed row indices do not match guessed column indices.")
 
-    missing = np.setdiff1d(
-        np.arange(mm.matrix.shape[0]), col_indices, assume_unique=True
-    )
+    missing = np.setdiff1d(np.arange(mm.matrix.shape[0]), col_indices, assume_unique=True)
     if missing.size:
         raise UnclearProductionExchange(
             "Can't find production exchanges for columns: {}".format(list(missing))

{bw_graph_tools-0.3 → bw_graph_tools-0.4}/bw_graph_tools/shortest_path.py

@@ -36,16 +36,23 @@ OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISE
 OF THE POSSIBILITY OF SUCH DAMAGE.
 
 """
+
 from functools import partial
 from multiprocessing import Pool
-from typing import Optional, Union, Iterable
+from typing import Iterable, Optional, Union
 
 import numpy as np
 from scipy import sparse
 
 
-def get_distances(adjacency: sparse.csr_matrix, sources: Optional[Union[int, Iterable]] = None, method: str = 'D',
-                  return_predecessors: bool = False, unweighted: bool = False, n_jobs: Optional[int] = None):
+def get_distances(
+    adjacency: sparse.csr_matrix,
+    sources: Optional[Union[int, Iterable]] = None,
+    method: str = "D",
+    return_predecessors: bool = False,
+    unweighted: bool = False,
+    n_jobs: Optional[int] = None,
+):
     """Compute distances between nodes.
 
     * Graphs
@@ -88,28 +95,40 @@ def get_distances(adjacency: sparse.csr_matrix, sources: Optional[Union[int, Ite
 
     """
     n_jobs, directed = 1, True
-    if method == 'FW' and n_jobs != 1:
-        raise ValueError('The Floyd-Warshall algorithm cannot be used with parallel computations.')
+    if method == "FW" and n_jobs != 1:
+        raise ValueError("The Floyd-Warshall algorithm cannot be used with parallel computations.")
     if sources is None:
         sources = np.arange(adjacency.shape[0])
     elif np.issubdtype(type(sources), np.integer):
         sources = np.array([sources])
     n = len(sources)
-    local_function = partial(sparse.csgraph.shortest_path,
-                             adjacency, method, directed, return_predecessors, unweighted, False)
+    local_function = partial(
+        sparse.csgraph.shortest_path,
+        adjacency,
+        method,
+        directed,
+        return_predecessors,
+        unweighted,
+        False,
+    )
     if n_jobs == 1 or n == 1:
         try:
-            res = sparse.csgraph.shortest_path(adjacency, method, directed, return_predecessors,
-                                               unweighted, False, sources)
+            res = sparse.csgraph.shortest_path(
+                adjacency, method, directed, return_predecessors, unweighted, False, sources
+            )
         except sparse.csgraph.NegativeCycleError:
-            raise ValueError("The shortest path computation could not be completed because a negative cycle is present.")
+            raise ValueError(
+                "The shortest path computation could not be completed because a negative cycle is present."
+            )
     else:
         try:
             with Pool(n_jobs) as pool:
                 res = np.array(pool.map(local_function, sources))
         except sparse.csgraph.NegativeCycleError:
             pool.terminate()
-            raise ValueError("The shortest path computation could not be completed because a negative cycle is present.")
+            raise ValueError(
+                "The shortest path computation could not be completed because a negative cycle is present."
+            )
     if return_predecessors:
         res[1][res[1] < 0] = -1
         if n == 1:
@@ -123,8 +142,14 @@ def get_distances(adjacency: sparse.csr_matrix, sources: Optional[Union[int, Ite
             return res
 
 
-def get_shortest_path(adjacency: sparse.csr_matrix, sources: Union[int, Iterable], targets: Union[int, Iterable],
-                      method: str = 'D', unweighted: bool = False, n_jobs: Optional[int] = None):
+def get_shortest_path(
+    adjacency: sparse.csr_matrix,
+    sources: Union[int, Iterable],
+    targets: Union[int, Iterable],
+    method: str = "D",
+    unweighted: bool = False,
+    n_jobs: Optional[int] = None,
+):
     """Compute the shortest paths in the graph.
 
     Parameters
@@ -181,7 +206,8 @@ def get_shortest_path(adjacency: sparse.csr_matrix, sources: Union[int, Iterable
         targets = sources
     else:
         raise ValueError(
-            'This request is ambiguous. Either use one source and multiple targets or multiple sources and one target.')
+            "This request is ambiguous. Either use one source and multiple targets or multiple sources and one target."
+        )
 
     if source2target:
         dists, preds = get_distances(adjacency, source, method, True, unweighted, n_jobs)

{bw_graph_tools-0.3 → bw_graph_tools-0.4}/bw_graph_tools/testing.py

@@ -1,10 +1,12 @@
 from numbers import Number
+from typing import Union
+
 import numpy as np
 
-from . import Node, Edge, Flow
+from . import Edge, Flow, Node
 
 
-def equal_dict(a: Node | Edge | Flow, b: dict, fields: list[str]):
+def equal_dict(a: Union[Node, Edge, Flow], b: dict, fields: list[str]):
     for field in fields:
         if field in b:
             if isinstance(b[field], Number):

{bw_graph_tools-0.3 → bw_graph_tools-0.4}/bw_graph_tools.egg-info/PKG-INFO

@@ -1,43 +1,44 @@
 Metadata-Version: 2.1
-Name: bw-graph-tools
-Version: 0.3
+Name: bw_graph_tools
+Version: 0.4
 Summary: Graph traversal class and utilities
-Home-page: https://github.com/brightway-lca/bw_graph_tools
-Author: Chris Mutel
-Author-email: <cmutel@gmail.com>
-Maintainer: Chris Mutel
-Maintainer-email: <cmutel@gmail.com>
-License: BSD-3-Clause
+Author-email: Chris Mutel <cmutel@gmail.com>
+Maintainer-email: Chris Mutel <cmutel@gmail.com>
 Project-URL: source, https://github.com/brightway-lca/bw_graph_tools
 Project-URL: homepage, https://github.com/brightway-lca/bw_graph_tools
 Project-URL: tracker, https://github.com/brightway-lca/bw_graph_tools/issues
-Keywords: "brightway","development"
-Platform: any
-Classifier: Development Status :: 4 - Beta
+Classifier: Development Status :: 5 - Production/Stable
 Classifier: Programming Language :: Python
 Classifier: Programming Language :: Python :: 3
+Classifier: Programming Language :: Python :: 3.9
 Classifier: Programming Language :: Python :: 3.10
 Classifier: Programming Language :: Python :: 3.11
-Requires-Python: >=3.8
-Description-Content-Type: text/markdown; charset=UTF-8
+Classifier: Programming Language :: Python :: 3.12
+Classifier: Natural Language :: English
+Classifier: Operating System :: OS Independent
+Classifier: Topic :: Scientific/Engineering
+Requires-Python: >=3.9
+Description-Content-Type: text/markdown
 License-File: LICENSE
 Requires-Dist: bw2calc>=2.0.dev13
+Requires-Dist: bw_processing
 Requires-Dist: matrix_utils
-Requires-Dist: numpy
+Requires-Dist: numpy<2
 Requires-Dist: scipy
-Requires-Dist: bw_processing
 Provides-Extra: testing
-Requires-Dist: setuptools; extra == "testing"
+Requires-Dist: bw_graph_tools; extra == "testing"
+Requires-Dist: bw2data; extra == "testing"
 Requires-Dist: pytest; extra == "testing"
 Requires-Dist: pytest-cov; extra == "testing"
-Requires-Dist: bw2data>=4.0.dev18; extra == "testing"
+Requires-Dist: python-coveralls; extra == "testing"
 Provides-Extra: dev
+Requires-Dist: build; extra == "dev"
 Requires-Dist: pre-commit; extra == "dev"
 Requires-Dist: pylint; extra == "dev"
-Provides-Extra: docs
-Requires-Dist: sphinx; extra == "docs"
-Requires-Dist: myst_parser; extra == "docs"
-Requires-Dist: furo; extra == "docs"
+Requires-Dist: pytest; extra == "dev"
+Requires-Dist: pytest-cov; extra == "dev"
+Requires-Dist: pytest-randomly; extra == "dev"
+Requires-Dist: setuptools; extra == "dev"
 
 # bw_graph_tools
 
@@ -85,7 +86,6 @@ Normally we construct matrices and solve the resulting set of linear equations t
 If we add temporal information using `bw_temporalis`, then the same node can occur at different times depending on how the temporal dynamics its preceding path. For example:
 
 
-
 ## Contributing
 
 Contributions are very welcome.
@@ -103,15 +103,9 @@ please [file an issue] along with a detailed description.
 
 ## Documentation
 
-1. Install the `sphinx-furo` conda environment from the file `.docs/environment.yml`.
-2. Build the documentation locally by running
+1. Install the conda environment from the file `.docs/environment.yml`
+2. Build the documentation locally by running:
 
-```
+```bash
 sphinx-autobuild docs _build/html -a -j auto --open-browser
 ```
-
-<!-- github-only -->
-
-[command-line reference]: https://bw_graph_tools.readthedocs.io/en/latest/usage.html
-[license]: https://github.com/brightway-lca/bw_graph_tools/blob/main/LICENSE
-[contributor guide]: https://github.com/brightway-lca/bw_graph_tools/blob/main/CONTRIBUTING.md