pd-code-de-r1 0.0.1__tar.gz

pd_code_de_r1-0.0.1/LICENSE

@@ -0,0 +1,21 @@
+MIT License
+
+Copyright (c) 2026 TopologicalKnotIndexer
+
+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.

pd_code_de_r1-0.0.1/PKG-INFO

@@ -0,0 +1,37 @@
+Metadata-Version: 2.4
+Name: pd-code-de-r1
+Version: 0.0.1
+Summary: erase r1-move from link pd_code.
+License: MIT
+License-File: LICENSE
+Author: GGN_2015
+Author-email: neko@jlulug.org
+Requires-Python: >=3.10
+Classifier: License :: OSI Approved :: MIT License
+Classifier: Programming Language :: Python :: 3
+Classifier: Programming Language :: Python :: 3.10
+Classifier: Programming Language :: Python :: 3.11
+Classifier: Programming Language :: Python :: 3.12
+Classifier: Programming Language :: Python :: 3.13
+Classifier: Programming Language :: Python :: 3.14
+Requires-Dist: pd_code_sanity
+Description-Content-Type: text/markdown
+
+# pd_code_de_r1
+erase r1-move in link pd_code.
+
+## Install
+
+```bash
+pip install pd-code-de-r1
+```
+
+## Usage
+
+```python
+import pd_code_de_r1
+
+link_pd_code = [[1, 4, 2, 5], [5, 2, 6, 3], [3, 6, 4, 7], [7, 1, 8, 8]]
+print(pd_code_de_r1.de_r1(link_pd_code))
+```
+

pd_code_de_r1-0.0.1/README.md

@@ -0,0 +1,17 @@
+# pd_code_de_r1
+erase r1-move in link pd_code.
+
+## Install
+
+```bash
+pip install pd-code-de-r1
+```
+
+## Usage
+
+```python
+import pd_code_de_r1
+
+link_pd_code = [[1, 4, 2, 5], [5, 2, 6, 3], [3, 6, 4, 7], [7, 1, 8, 8]]
+print(pd_code_de_r1.de_r1(link_pd_code))
+```

pd_code_de_r1-0.0.1/pd_code_de_r1/__init__.py

@@ -0,0 +1,5 @@
+from .main import de_r1
+
+__all__ = [
+    "de_r1"
+]

pd_code_de_r1-0.0.1/pd_code_de_r1/main.py

@@ -0,0 +1,86 @@
+import pd_code_sanity
+
+# 向邻接表添加单向边
+def __add_arc(nxt: dict, a: int, b: int) -> None:
+    if nxt.get(a) is None:
+        nxt[a] = []
+    if b not in nxt[a]:
+        nxt[a].append(b)
+
+# 向邻接表添加双向边
+def __addedge(nxt: dict, a: int, b: int) -> None:
+    __add_arc(nxt, a, b)
+    __add_arc(nxt, b, a)
+
+# 构造邻接表
+def __get_nxt(pd_code: list) -> dict:
+    nxt = {}
+    for line in pd_code:
+        a, b, c, d = line # a -> c, b -> d
+        __addedge(nxt, a, c)
+        __addedge(nxt, b, d)
+    return nxt
+
+# 搜索找环
+def __dfs(nxt: dict, vis: list, pos: int) -> None:
+    assert pos not in vis
+    vis.append(pos)
+
+    while True:
+        top_pos      = vis[-1]
+        avai_nxt_pos = [v for v in nxt[top_pos] if v not in vis]
+        if len(avai_nxt_pos) == 0: # 无路可走
+            break
+        vis.append(avai_nxt_pos[0])
+
+def __get_value_set(pd_code: list) -> set:
+    value_set = set()
+    for x in pd_code:
+        for v in x:
+            if v not in value_set:
+                value_set.add(v)
+    return value_set
+
+# 删除 pd_code 中的所有 r1 拧
+def de_r1(pd_code: list[list]) -> list[list]:
+
+    # 检验 pd_code 合法性
+    if not pd_code_sanity.sanity(pd_code):
+        raise TypeError()
+    
+    while any(len(set(x)) <= 3 for x in pd_code):
+        for i in range(len(pd_code)):
+            x = pd_code[i]
+            if len(set(x)) <= 3:
+                pd_code = pd_code[:i] + pd_code[i+1:] # 删除当前节点
+                single  = []
+                for v in x:
+                    if x.count(v) == 1:
+                        single.append(v)
+                
+                if len(single) == 2:
+                    pd_code = [[(single[1] if x==single[0] else x) for x in line] for line in pd_code]
+                    break
+    
+    # 获取编码集合
+    value_set = __get_value_set(pd_code)
+
+    # 重新编码
+    if pd_code != []:
+        nxt = __get_nxt(pd_code)
+        vis = list() # 得到 dfs 序
+
+        for value in value_set:
+            if value not in vis:
+                __dfs(nxt, vis, value)
+
+        # 给所有数据重新编码
+        new_id = {}
+        for i in range(len(vis)):
+            new_id[vis[i]] = i + 1
+        pd_code = [[new_id[v] for v in x] for x in pd_code]
+
+    return pd_code
+
+if __name__ == "__main__":
+    print(de_r1([[1, 4, 2, 5], [5, 2, 6, 3], [3, 6, 4, 7], [7, 1, 8, 8]]))

pd_code_de_r1-0.0.1/pyproject.toml

@@ -0,0 +1,18 @@
+[project]
+name = "pd-code-de-r1"
+version = "0.0.1"
+description = "erase r1-move from link pd_code."
+authors = [
+    {name = "GGN_2015",email = "neko@jlulug.org"}
+]
+license = {text = "MIT"}
+readme = "README.md"
+requires-python = ">=3.10"
+dependencies = [
+    "pd_code_sanity"
+]
+
+
+[build-system]
+requires = ["poetry-core>=2.0.0,<3.0.0"]
+build-backend = "poetry.core.masonry.api"