pathfinding-tools-dijkstra 1.0.0__tar.gz

pathfinding_tools_dijkstra-1.0.0/PKG-INFO

@@ -0,0 +1,10 @@
+Metadata-Version: 2.4
+Name: pathfinding-tools-dijkstra
+Version: 1.0.0
+Summary: Pathfinding tools including a dijkstra algorithm
+Author: Your Name
+Requires-Python: >=3.8
+Description-Content-Type: text/markdown
+Requires-Dist: numpy>=1.26.0
+
+# dijkstra-pathfinding-tools

pathfinding_tools_dijkstra-1.0.0/README.md

@@ -0,0 +1 @@
+# dijkstra-pathfinding-tools

pathfinding_tools_dijkstra-1.0.0/dijkstra/__init__.py

@@ -0,0 +1,5 @@
+from numpy import *
+from .methods import *
+
+
+

pathfinding_tools_dijkstra-1.0.0/dijkstra/methods.py

@@ -0,0 +1,68 @@
+from typing import Dict, List
+
+
+class Node:
+    def __init__(self, data=None):
+        self.data = data
+
+
+class Edge:
+    def __init__(self, node1, node2, cost=1.0, data=None):
+        self.data = data
+        self.node1: Node = node1
+        self.node2: Node = node2
+        self.cost: float = cost
+
+
+class Path:
+    def __init__(self, nodes, edges, cost):
+        self.nodes: List[Node] = nodes
+        self.edges: List[Edge] = edges
+        self.cost: float = cost
+
+
+def extend_path(old_path, edge, node):
+    return Path(nodes=old_path.nodes + [node],
+                edges=old_path.edges+[edge],
+                cost=old_path.cost+edge.cost)
+
+
+def dijkstra(nodes, edges, start_node, end_node=None, bidirectional=True):
+
+    edges_of_node = dict((n, []) for n in nodes)
+    for edge in edges:
+        edges_of_node[edge.node1].append((edge, edge.node2))
+        if (bidirectional):
+            edges_of_node[edge.node2].append((edge, edge.node1))
+
+    reached_nodes: Dict[Node, Path] = {}
+    unresolved_reached_nodes: List[Node] = []
+
+    reached_nodes[start_node] = Path(nodes=[start_node], edges=[], cost=0)
+    unresolved_reached_nodes.append(start_node)
+
+    def reach_node(node, new_path):
+        if node in reached_nodes:
+            old_path = reached_nodes[node]
+            if (new_path.cost < old_path.cost):
+                reached_nodes[node] = new_path
+        else:
+            reached_nodes[node] = new_path
+            unresolved_reached_nodes.append(node)
+
+    def resolve_node(node):
+        old_path = reached_nodes[node]
+        for edge, next_node in edges_of_node[node]:
+            new_path = extend_path(old_path, edge, next_node)
+            reach_node(next_node, new_path)
+
+    while len(unresolved_reached_nodes) > 0:
+        unresolved_reached_nodes.sort(
+            key=lambda node: reached_nodes[node].cost)
+        node = unresolved_reached_nodes[0]
+        if (node is end_node):
+            break
+        resolve_node(node)
+        unresolved_reached_nodes.remove(node)
+
+    return reached_nodes

pathfinding_tools_dijkstra-1.0.0/pathfinding_tools_dijkstra.egg-info/PKG-INFO

@@ -0,0 +1,10 @@
+Metadata-Version: 2.4
+Name: pathfinding-tools-dijkstra
+Version: 1.0.0
+Summary: Pathfinding tools including a dijkstra algorithm
+Author: Your Name
+Requires-Python: >=3.8
+Description-Content-Type: text/markdown
+Requires-Dist: numpy>=1.26.0
+
+# dijkstra-pathfinding-tools

pathfinding_tools_dijkstra-1.0.0/pathfinding_tools_dijkstra.egg-info/SOURCES.txt

@@ -0,0 +1,9 @@
+README.md
+pyproject.toml
+dijkstra/__init__.py
+dijkstra/methods.py
+pathfinding_tools_dijkstra.egg-info/PKG-INFO
+pathfinding_tools_dijkstra.egg-info/SOURCES.txt
+pathfinding_tools_dijkstra.egg-info/dependency_links.txt
+pathfinding_tools_dijkstra.egg-info/requires.txt
+pathfinding_tools_dijkstra.egg-info/top_level.txt

pathfinding_tools_dijkstra-1.0.0/pathfinding_tools_dijkstra.egg-info/dependency_links.txt

@@ -0,0 +1 @@
+

pathfinding_tools_dijkstra-1.0.0/pathfinding_tools_dijkstra.egg-info/requires.txt

@@ -0,0 +1 @@
+numpy>=1.26.0

pathfinding_tools_dijkstra-1.0.0/pathfinding_tools_dijkstra.egg-info/top_level.txt

@@ -0,0 +1 @@
+dijkstra

pathfinding_tools_dijkstra-1.0.0/pyproject.toml

@@ -0,0 +1,20 @@
+[build-system]
+requires = ["setuptools>=68", "wheel"]
+build-backend = "setuptools.build_meta"
+
+[project]
+name = "pathfinding-tools-dijkstra"
+version = "1.0.0"
+description = "Pathfinding tools including a dijkstra algorithm"
+authors = [
+    { name="Your Name" }
+]
+readme = "README.md"
+requires-python = ">=3.8"
+
+dependencies = [
+    "numpy>=1.26.0"
+]
+
+[tool.setuptools]
+packages = ["dijkstra"]

pathfinding_tools_dijkstra-1.0.0/setup.cfg

@@ -0,0 +1,4 @@
+[egg_info]
+tag_build = 
+tag_date = 0
+