pd-code-components 0.0.2__tar.gz → 0.1.0__tar.gz

{pd_code_components-0.0.2 → pd_code_components-0.1.0}/PKG-INFO

@@ -1,6 +1,6 @@
 Metadata-Version: 2.4
 Name: pd-code-components
-Version: 0.0.2
+Version: 0.1.0
 Summary: get all components from a link pd code.
 License: MIT
 License-File: LICENSE
@@ -16,19 +16,27 @@ Classifier: Programming Language :: Python :: 3.13
 Classifier: Programming Language :: Python :: 3.14
 Description-Content-Type: text/markdown
 
-# pd_code_components
-计算 pd_code 中的每一个连通分量对应的编号集合
+# pd-code-components
 
-## Install
+Find link components in a planar-diagram code.
+
+## Installation
 
 ```bash
 pip install pd-code-components
 ```
 
-## Usage
+## Quick start
 
-```bash
-from pd_code_components import get_components_from_pd_code
-print(get_components_from_pd_code([[6, 1, 7, 2], [10, 4, 11, 3], [12, 8, 13, 7], [18, 16, 19, 15], [16, 9, 17, 10], [8, 17, 9, 18], [20, 14, 5, 13], [14, 20, 15, 19], [2, 5, 3, 6], [4, 12, 1, 11]]))
-```
+`from pd_code_components import get_components_from_pd_code`.
+
+PD codes are lists of four-entry crossings. Each arc label must occur exactly twice. Functions validate their inputs and do not mutate caller-owned PD-code lists unless explicitly documented.
+
+## Development
+
+Use Python 3.10 or newer for Python packages. Build distributions with `poetry build`. Run the package's tests or examples before publishing. C++ projects require a modern standards-compliant compiler.
+
+## License
+
+MIT. See `LICENSE`.
 

pd_code_components-0.1.0/README.md

@@ -0,0 +1,23 @@
+# pd-code-components
+
+Find link components in a planar-diagram code.
+
+## Installation
+
+```bash
+pip install pd-code-components
+```
+
+## Quick start
+
+`from pd_code_components import get_components_from_pd_code`.
+
+PD codes are lists of four-entry crossings. Each arc label must occur exactly twice. Functions validate their inputs and do not mutate caller-owned PD-code lists unless explicitly documented.
+
+## Development
+
+Use Python 3.10 or newer for Python packages. Build distributions with `poetry build`. Run the package's tests or examples before publishing. C++ projects require a modern standards-compliant compiler.
+
+## License
+
+MIT. See `LICENSE`.

pd_code_components-0.1.0/pd_code_components/main.py

@@ -0,0 +1,40 @@
+from collections import defaultdict
+
+
+def _sort_key(value: int | str) -> tuple[int, int | str]:
+    return (0, value) if isinstance(value, int) else (1, value)
+
+
+def get_components_from_pd_code(pd_code: list[list[int | str]]) -> list[list[int | str]]:
+    """Return the oriented-link components represented by a valid PD code."""
+    if not isinstance(pd_code, list):
+        raise TypeError("pd_code must be a list")
+
+    graph: dict[int | str, set[int | str]] = defaultdict(set)
+    for crossing in pd_code:
+        if not isinstance(crossing, list) or len(crossing) != 4:
+            raise ValueError("every crossing must contain four labels")
+        for label in crossing:
+            if isinstance(label, bool) or not isinstance(label, (int, str)):
+                raise TypeError("PD labels must be integers or strings")
+        for a, b in ((crossing[0], crossing[2]), (crossing[1], crossing[3])):
+            graph[a].add(b)
+            graph[b].add(a)
+
+    components: list[list[int | str]] = []
+    seen: set[int | str] = set()
+    for start in sorted(graph, key=_sort_key):
+        if start in seen:
+            continue
+        stack = [start]
+        seen.add(start)
+        component: list[int | str] = []
+        while stack:
+            node = stack.pop()
+            component.append(node)
+            for neighbor in graph[node]:
+                if neighbor not in seen:
+                    seen.add(neighbor)
+                    stack.append(neighbor)
+        components.append(sorted(component, key=_sort_key))
+    return components

{pd_code_components-0.0.2 → pd_code_components-0.1.0}/pyproject.toml

@@ -1,6 +1,6 @@
 [project]
 name = "pd-code-components"
-version = "0.0.2"
+version = "0.1.0"
 description = "get all components from a link pd code."
 authors = [
     {name = "GGN_2015",email = "premierbob@qq.com"}
@@ -14,4 +14,4 @@ dependencies = [
 
 [build-system]
 requires = ["poetry-core>=2.0.0,<3.0.0"]
-build-backend = "poetry.core.masonry.api"
+build-backend = "poetry.core.masonry.api"

pd_code_components-0.0.2/README.md

@@ -1,15 +0,0 @@
-# pd_code_components
-计算 pd_code 中的每一个连通分量对应的编号集合
-
-## Install
-
-```bash
-pip install pd-code-components
-```
-
-## Usage
-
-```bash
-from pd_code_components import get_components_from_pd_code
-print(get_components_from_pd_code([[6, 1, 7, 2], [10, 4, 11, 3], [12, 8, 13, 7], [18, 16, 19, 15], [16, 9, 17, 10], [8, 17, 9, 18], [20, 14, 5, 13], [14, 20, 15, 19], [2, 5, 3, 6], [4, 12, 1, 11]]))
-```

pd_code_components-0.0.2/pd_code_components/main.py

@@ -1,53 +0,0 @@
-
-# 向一个指定的图中新增节点
-def add_edge(nxt:dict, node_a:str|int, node_b:str|int):
-
-    # 确保节点存在
-    if nxt.get(node_a) is None:
-        nxt[node_a] = []
-    if nxt.get(node_b) is None:
-        nxt[node_b] = []
-
-    # 将节点加入到列表中
-    if node_b not in nxt[node_a]:
-        nxt[node_a].append(node_b)
-    if node_a not in nxt[node_b]:
-        nxt[node_b].append(node_a)
-
-# 使用深度优先搜索确定所有连通分量
-def dfs(nxt:dict, vis:list, arr:list, node_name:str|int):
-    if node_name in vis:
-        return
-    vis.append(node_name)
-    arr.append(node_name)
-    for nxt_node in nxt[node_name]:
-        dfs(nxt, vis, arr, nxt_node)
-
-# 从 pd_code 中计算每一个连通分支对应的数值集合
-def get_components_from_pd_code(pd_code:list[list[int|str]]) -> list[list[int|str]]:
-    if not isinstance(pd_code, list):
-        raise TypeError()
-    for item in pd_code:
-        if len(item) != 4:
-            raise AssertionError()
-        for sub_item in item:
-            if (not isinstance(sub_item, str)) and (not isinstance(sub_item, int)):
-                raise TypeError()
-    
-    # nxt 记录每个节点的后继节点（一般来说有两个）
-    nxt = {}
-    
-    # 建图   
-    for crossing in pd_code:
-        add_edge(nxt, crossing[0], crossing[2])
-        add_edge(nxt, crossing[1], crossing[3])
-
-    vis = []
-    components = []
-    for node_name in nxt:
-        if node_name not in vis:
-            arr = []
-            dfs(nxt, vis, arr, node_name)
-            components.append(sorted(arr))
-    
-    return sorted(components)