Finalized Grid visiualization

Implemented A* Algorithm separatly to reduce clutering in traverse function
2025-05-06 00:10:13 +02:00
parent 229fb4e4e2
commit 565d08290c
8 changed files with 501 additions and 150 deletions
--- a/P1/main.py
+++ b/P1/main.py
@@ -0,0 +1,41 @@
+from grid import a_star_main
+from search import ucs, bfs, dfs
+from graph import Graph
+
+# directed and weighted digraph
+romania = Graph(['Or', 'Ne', 'Ze', 'Ia', 'Ar', 'Si', 'Fa',
+                 'Va', 'Ri', 'Ti', 'Lu', 'Pi', 'Ur', 'Hi',
+                 'Me', 'Bu', 'Dr', 'Ef', 'Cr', 'Gi'],
+                [
+                    ('Or', 'Ze', 71), ('Or', 'Si', 151),
+                    ('Ne', 'Ia', 87), ('Ze', 'Ar', 75),
+                    ('Ia', 'Va', 92), ('Ar', 'Si', 140),
+                    ('Ar', 'Ti', 118), ('Si', 'Fa', 99),
+                    ('Si', 'Ri', 80), ('Fa', 'Bu', 211),
+                    ('Va', 'Ur', 142), ('Ri', 'Pi', 97),
+                    ('Ri', 'Cr', 146), ('Ti', 'Lu', 111),
+                    ('Lu', 'Me', 70), ('Me', 'Dr', 75),
+                    ('Dr', 'Cr', 120), ('Cr', 'Pi', 138),
+                    ('Pi', 'Bu', 101), ('Bu', 'Gi', 90),
+                    ('Bu', 'Ur', 85), ('Ur', 'Hi', 98),
+                    ('Hi', 'Ef', 86)
+                ])
+
+
+def main():
+    # Task 1
+    graph = romania
+    ucs(graph, 'Si', 'Bu')
+
+    graph = romania
+    bfs(graph, 'Si', 'Bu')
+
+    graph = romania
+    dfs(graph, 'Si', 'Bu')
+
+    # Task 3 A*
+    a_star_main()
+
+
+if __name__ == "__main__":
+    main()