From 229fb4e4e2ad573785754ae026c729fb4ff01d5a Mon Sep 17 00:00:00 2001
From: Safak <safak.hazinedar@startmail.com>
Date: Tue, 15 Apr 2025 17:24:18 +0200
Subject: [PATCH] UCS

---
 graph.py |  2 +-
 main.py  | 38 ++++++++++++++++++++++++--------------
 2 files changed, 25 insertions(+), 15 deletions(-)

diff --git a/graph.py b/graph.py
index 9c1fa6c..5c5d1ed 100644
--- a/graph.py
+++ b/graph.py
@@ -7,7 +7,7 @@ class Node:
         self.parent = None
         self.name = name
         self.edges = []
-        self.value = 0
+        self.value = 0  # cost reaching this node
 
 class Edge:
 
diff --git a/main.py b/main.py
index b578e8b..a6c3c2a 100644
--- a/main.py
+++ b/main.py
@@ -21,43 +21,48 @@ romania = Graph( ['Or', 'Ne', 'Ze', 'Ia', 'Ar', 'Si', 'Fa',
                 ] )
 
 def search(graph, queue, start_node_name, target_node_name):
-    cost = 0
     visited_nodes = []   # Nodes which have been visited
     path = []
 
     start_node = getNode(start_node_name, graph.nodes)
     target_node = getNode(target_node_name, graph.nodes)
 
+    start_node.value = 0
+
     queue.push(start_node)
 
     while not queue.empty():
         current_node = queue.pop()
         visited_nodes.append(current_node.name)
 
-        if current_node == target_node:
-            path.append(current_node.name)
-            tmp = current_node
-            while not tmp == start_node:
-                for edge in tmp.parent.edges:
-                    if edge.end.name == tmp.name:
-                        cost += edge.value
-                tmp = tmp.parent
-                path.insert(0, tmp.name)    # reversed insertion
-        else:
+        if not current_node == target_node:
             for edge in current_node.edges:
                 neighbor = edge.end
+                condition = not visited_nodes.__contains__(neighbor.name)
+                new_cost = current_node.value + edge.value
+
+                # UCS
+                if queue.type == 'PRIO':
+                    condition = not visited_nodes.__contains__(neighbor.name) and new_cost < neighbor.value
 
                 # works with digraph, because current_node is marked at this point, a cycle is not possible
-                if not visited_nodes.__contains__(neighbor.name):
-                    queue.push(neighbor)
+                if condition:
                     neighbor.parent = current_node
+                    neighbor.value = new_cost
+                    queue.push(neighbor)
+        else:
+            path.append(current_node.name)
+            while not current_node == start_node:
+                current_node = current_node.parent
+                path.insert(0, current_node.name)
+
 
     if path.__len__() == 0:
         print('zwischen ' + start_node_name + ' und ' + target_node_name + ' konnte kein Pfad gefunden werden')
     else:
         print('From ' + start_node_name + ' to ' + target_node_name + ': ')
         print('Path: ' + path.__str__().format())
-        print('Cost: ' + cost.__str__())
+        print('Cost: ' + target_node.value.__str__())
 
 def bfs(graph, start_node_name, target_node_name):
     search(graph,Queue('FIFO'),start_node_name, target_node_name)
@@ -65,9 +70,14 @@ def bfs(graph, start_node_name, target_node_name):
 def dfs(graph, start_node_name, target_node_name):
     search(graph,Queue('LIFO'),start_node_name, target_node_name)
 
+def utc(graph, start_node_name, target_node_name):
+    search(graph,Queue('PRIO'),start_node_name, target_node_name)
+
+
 def main():
     bfs(romania, 'Ti', 'Bu')
     dfs(romania, 'Ti', 'Bu')
+    utc(romania, 'Or', 'Si')
 
 if __name__ == "__main__":
     main()
\ No newline at end of file