update pg path query

code/infrastructure/eval/query/pg/queries/queries.txt

@@ -30,46 +30,48 @@ descendant|WITH RECURSIVE DescendantCTE AS (
 )
 SELECT DISTINCT node_no, source, Level FROM DescendantCTE;
 ---
-path|WITH RECURSIVE path_cte AS (
-  -- Anchor member initialization
+path|WITH RECURSIVE search_path(edge_no, path, dest, visited, depth) AS (
   SELECT 
-    el.source AS start_node,
-    el.dest AS end_node,
-    ARRAY[el.source::varchar] AS path,  -- Cast to varchar to ensure type consistency
-    1 AS depth  -- Keep track of the depth to prevent infinite loops
+    e.edge_no,
+    ARRAY[e.source, e.dest]::VARCHAR[] AS path, -- Cast to VARCHAR[]
+    e.dest,
+    ARRAY[e.source]::VARCHAR[] AS visited, -- Cast to VARCHAR[]
+    1 AS depth
   FROM 
-    edge_list el
+    edge_list e
   WHERE 
-    el.source = '0CF2BB3E-36B8-11E8-BF66-D9AA8AFF4A69'  -- Replace with the UUID of the starting node
+    e.source = 'A6A7C956-0132-5506-96D1-2A7DE97CB400' -- Starting Node 43C4E3CF-B655-5D90-8F1F-EFB3E7D27AA1
   
   UNION ALL
   
-  -- Recursive member definition
   SELECT 
-    p.start_node,
-    el.dest,
-    p.path || el.dest::varchar,  -- Ensure el.dest is cast to varchar
-    p.depth + 1
+    e.edge_no,
+    sp.path || e.dest,
+    e.dest,
+    visited || e.dest::VARCHAR, -- Ensure consistent type
+    sp.depth + 1
   FROM 
-    edge_list el
-  JOIN 
-    path_cte p ON el.source = p.end_node
+    edge_list e, search_path sp
   WHERE 
-    NOT (el.dest = ANY(p.path))  -- Prevent cycles by ensuring we don't revisit nodes
-    AND p.depth < 100  -- Example limit to prevent infinite recursion
+    e.source = sp.dest
+    AND NOT (e.dest = ANY(sp.visited)) -- Adjusted to ensure clarity and type consistency
 )
-
--- Final query to select the path
-SELECT distinct
-  start_node, end_node, path, depth
+, shortest_paths AS (
+  SELECT 
+    path,
+    depth
   FROM 
-  path_cte
+    search_path
   WHERE 
-  end_node = '586C56DA-CB56-745E-96CB-52069E742598'  -- Replace with the UUID of the ending node
+    dest = '8DA367BF-36C2-11E8-BF66-D9AA8AFF4A69' -- Destination Node 458F029B-36C2-11E8-BF66-D9AA8AFF4A69
   ORDER BY 
-  depth ASC  -- Optional: orders by the shortest path
---LIMIT 1  -- Optionally limit to one path if multiple paths exist
-;
+    depth ASC
+  LIMIT 1 -- Adjust based on desired number of shortest paths
+)
+SELECT 
+  path
+FROM 
+  shortest_paths;
 ---
 k-hop|WITH hop1 AS (
     SELECT DISTINCT e.source, e.dest