networkx-reverse-topological-sort 0.1.0a0__tar.gz

networkx_reverse_topological_sort-0.1.0a0/LICENSE

@@ -0,0 +1,21 @@
+MIT License
+
+Copyright (c) 2025 Jifeng Wu
+
+Permission is hereby granted, free of charge, to any person obtaining a copy
+of this software and associated documentation files (the "Software"), to deal
+in the Software without restriction, including without limitation the rights
+to use, copy, modify, merge, publish, distribute, sublicense, and/or sell
+copies of the Software, and to permit persons to whom the Software is
+furnished to do so, subject to the following conditions:
+
+The above copyright notice and this permission notice shall be included in all
+copies or substantial portions of the Software.
+
+THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR
+IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,
+FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE
+AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER
+LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM,
+OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE
+SOFTWARE.

networkx_reverse_topological_sort-0.1.0a0/PKG-INFO

@@ -0,0 +1,62 @@
+Metadata-Version: 2.4
+Name: networkx-reverse-topological-sort
+Version: 0.1.0a0
+Summary: Reverse topological sort utilities for NetworkX: easily stratify or sort nodes in a DAG from leaves to root.
+Author-email: Jifeng Wu <jifengwu2k@gmail.com>
+License-Expression: MIT
+Project-URL: Homepage, https://github.com/jifengwu2k/networkx-reverse-topological-sort
+Project-URL: Bug Tracker, https://github.com/jifengwu2k/networkx-reverse-topological-sort/issues
+Classifier: Programming Language :: Python :: 2
+Classifier: Programming Language :: Python :: 3
+Classifier: Operating System :: OS Independent
+Requires-Python: >=2
+Description-Content-Type: text/markdown
+License-File: LICENSE
+Requires-Dist: networkx
+Dynamic: license-file
+
+# `networkx-reverse-topological-sort`
+
+Reverse topological sort utilities for [NetworkX](https://networkx.org/): easily stratify or sort nodes in a DAG from leaves to root.
+
+## Features
+
+- **Reverse Topological Sort**: Get a valid reverse of NetworkX's `topological_sort`, yielding from "leaf" nodes up to roots.
+- **Reverse Topological Generations**: Partition your DAG into generations in reverse order (each generation, all children are in earlier generations).
+
+## Motivation
+
+NetworkX includes tools for forward (root-to-leaf) topological traversals, but some applications (e.g., evaluating dependencies after their dependents, post-order processing, certain scheduling schemes) need the reverse order: leaves to root.
+
+This tiny package offers that for `networkx`.
+
+## Installation
+
+```
+pip install networkx-reverse-topological-sort
+```
+
+## Usage
+
+```python
+import networkx as nx
+from networkx_reverse_topological_sort import (
+    reverse_topological_generations,
+    reverse_topological_sort,
+)
+
+DG = nx.DiGraph([(2, 1), (3, 1)])
+print([sorted(generation) for generation in reverse_topological_generations(DG)])
+# Output: [[1], [2, 3]]
+
+print(list(reverse_topological_sort(DG)))
+# Output: [1, 2, 3]  (or [1, 3, 2]: nodes before their parents)
+```
+
+## Contributing
+
+Contributions are welcome! Please submit pull requests or open issues on the GitHub repository.
+
+## License
+
+This project is licensed under the [MIT License](LICENSE).

networkx_reverse_topological_sort-0.1.0a0/README.md

@@ -0,0 +1,45 @@
+# `networkx-reverse-topological-sort`
+
+Reverse topological sort utilities for [NetworkX](https://networkx.org/): easily stratify or sort nodes in a DAG from leaves to root.
+
+## Features
+
+- **Reverse Topological Sort**: Get a valid reverse of NetworkX's `topological_sort`, yielding from "leaf" nodes up to roots.
+- **Reverse Topological Generations**: Partition your DAG into generations in reverse order (each generation, all children are in earlier generations).
+
+## Motivation
+
+NetworkX includes tools for forward (root-to-leaf) topological traversals, but some applications (e.g., evaluating dependencies after their dependents, post-order processing, certain scheduling schemes) need the reverse order: leaves to root.
+
+This tiny package offers that for `networkx`.
+
+## Installation
+
+```
+pip install networkx-reverse-topological-sort
+```
+
+## Usage
+
+```python
+import networkx as nx
+from networkx_reverse_topological_sort import (
+    reverse_topological_generations,
+    reverse_topological_sort,
+)
+
+DG = nx.DiGraph([(2, 1), (3, 1)])
+print([sorted(generation) for generation in reverse_topological_generations(DG)])
+# Output: [[1], [2, 3]]
+
+print(list(reverse_topological_sort(DG)))
+# Output: [1, 2, 3]  (or [1, 3, 2]: nodes before their parents)
+```
+
+## Contributing
+
+Contributions are welcome! Please submit pull requests or open issues on the GitHub repository.
+
+## License
+
+This project is licensed under the [MIT License](LICENSE).

networkx_reverse_topological_sort-0.1.0a0/networkx_reverse_topological_sort.egg-info/PKG-INFO

@@ -0,0 +1,62 @@
+Metadata-Version: 2.4
+Name: networkx-reverse-topological-sort
+Version: 0.1.0a0
+Summary: Reverse topological sort utilities for NetworkX: easily stratify or sort nodes in a DAG from leaves to root.
+Author-email: Jifeng Wu <jifengwu2k@gmail.com>
+License-Expression: MIT
+Project-URL: Homepage, https://github.com/jifengwu2k/networkx-reverse-topological-sort
+Project-URL: Bug Tracker, https://github.com/jifengwu2k/networkx-reverse-topological-sort/issues
+Classifier: Programming Language :: Python :: 2
+Classifier: Programming Language :: Python :: 3
+Classifier: Operating System :: OS Independent
+Requires-Python: >=2
+Description-Content-Type: text/markdown
+License-File: LICENSE
+Requires-Dist: networkx
+Dynamic: license-file
+
+# `networkx-reverse-topological-sort`
+
+Reverse topological sort utilities for [NetworkX](https://networkx.org/): easily stratify or sort nodes in a DAG from leaves to root.
+
+## Features
+
+- **Reverse Topological Sort**: Get a valid reverse of NetworkX's `topological_sort`, yielding from "leaf" nodes up to roots.
+- **Reverse Topological Generations**: Partition your DAG into generations in reverse order (each generation, all children are in earlier generations).
+
+## Motivation
+
+NetworkX includes tools for forward (root-to-leaf) topological traversals, but some applications (e.g., evaluating dependencies after their dependents, post-order processing, certain scheduling schemes) need the reverse order: leaves to root.
+
+This tiny package offers that for `networkx`.
+
+## Installation
+
+```
+pip install networkx-reverse-topological-sort
+```
+
+## Usage
+
+```python
+import networkx as nx
+from networkx_reverse_topological_sort import (
+    reverse_topological_generations,
+    reverse_topological_sort,
+)
+
+DG = nx.DiGraph([(2, 1), (3, 1)])
+print([sorted(generation) for generation in reverse_topological_generations(DG)])
+# Output: [[1], [2, 3]]
+
+print(list(reverse_topological_sort(DG)))
+# Output: [1, 2, 3]  (or [1, 3, 2]: nodes before their parents)
+```
+
+## Contributing
+
+Contributions are welcome! Please submit pull requests or open issues on the GitHub repository.
+
+## License
+
+This project is licensed under the [MIT License](LICENSE).

networkx_reverse_topological_sort-0.1.0a0/networkx_reverse_topological_sort.egg-info/SOURCES.txt

@@ -0,0 +1,10 @@
+LICENSE
+README.md
+networkx_reverse_topological_sort.py
+pyproject.toml
+setup.cfg
+networkx_reverse_topological_sort.egg-info/PKG-INFO
+networkx_reverse_topological_sort.egg-info/SOURCES.txt
+networkx_reverse_topological_sort.egg-info/dependency_links.txt
+networkx_reverse_topological_sort.egg-info/requires.txt
+networkx_reverse_topological_sort.egg-info/top_level.txt

networkx_reverse_topological_sort-0.1.0a0/networkx_reverse_topological_sort.egg-info/dependency_links.txt

@@ -0,0 +1 @@
+

networkx_reverse_topological_sort-0.1.0a0/networkx_reverse_topological_sort.egg-info/requires.txt

@@ -0,0 +1 @@
+networkx

networkx_reverse_topological_sort-0.1.0a0/networkx_reverse_topological_sort.egg-info/top_level.txt

@@ -0,0 +1 @@
+networkx_reverse_topological_sort

networkx_reverse_topological_sort-0.1.0a0/networkx_reverse_topological_sort.py

@@ -0,0 +1,45 @@
+import networkx as nx
+
+
+def reverse_topological_generations(G):
+    """
+    Stratifies a DAG into generations in reverse topological order.
+    That is, first generation are leaves (no outgoing edges), etc.
+    """
+    if not G.is_directed():
+        raise nx.NetworkXError("Topological sort not defined on undirected graphs.")
+
+    multigraph = G.is_multigraph()
+    # outdegree_map: only nodes with any outgoing edge
+    outdegree_map = {v: d for v, d in G.out_degree() if d > 0}
+    zero_outdegree = [v for v, d in G.out_degree() if d == 0]
+
+    while zero_outdegree:
+        this_generation = zero_outdegree
+        zero_outdegree = []
+        for node in this_generation:
+            if node not in G:
+                raise RuntimeError("Graph changed during iteration")
+            for parent in G.predecessors(node):
+                try:
+                    outdegree_map[parent] -= len(G[parent][node]) if multigraph else 1
+                except KeyError:
+                    raise RuntimeError("Graph changed during iteration")
+                if outdegree_map[parent] == 0:
+                    zero_outdegree.append(parent)
+                    del outdegree_map[parent]
+        yield this_generation
+
+    if outdegree_map:
+        raise nx.NetworkXUnfeasible(
+            "Graph contains a cycle or graph changed during iteration"
+        )
+
+
+def reverse_topological_sort(G):
+    """
+    Yields the nodes of G in reverse topological order (from leaves to roots).
+    """
+    for generation in reverse_topological_generations(G):
+        for node in generation:
+        	yield node

networkx_reverse_topological_sort-0.1.0a0/pyproject.toml

@@ -0,0 +1,26 @@
+[build-system]
+requires = ["setuptools"]
+build-backend = "setuptools.build_meta"
+
+[project]
+name = "networkx-reverse-topological-sort"
+version = "0.1.0a0"
+description = "Reverse topological sort utilities for NetworkX: easily stratify or sort nodes in a DAG from leaves to root."
+readme = "README.md"
+requires-python = ">=2"
+license = "MIT"
+authors = [
+  { name="Jifeng Wu", email="jifengwu2k@gmail.com" }
+]
+classifiers = [
+    "Programming Language :: Python :: 2",
+    "Programming Language :: Python :: 3",
+    "Operating System :: OS Independent",
+]
+dependencies = [
+    "networkx"
+]
+
+[project.urls]
+"Homepage" = "https://github.com/jifengwu2k/networkx-reverse-topological-sort"
+"Bug Tracker" = "https://github.com/jifengwu2k/networkx-reverse-topological-sort/issues"

networkx_reverse_topological_sort-0.1.0a0/setup.cfg

@@ -0,0 +1,7 @@
+[bdist_wheel]
+universal = 1
+
+[egg_info]
+tag_build = 
+tag_date = 0
+