From 4ba46b035ca9be1ca6a19ea4afd0aac80362b1c2 Mon Sep 17 00:00:00 2001 From: multipleof4 Date: Mon, 13 Oct 2025 10:24:33 -0700 Subject: [PATCH] Delete: Old generated file format --- .../outputs/openai_gpt-5-codex_2025-10-13T13-28-41.540Z.js | 1 - 1 file changed, 1 deletion(-) delete mode 100644 tests/1_dijkstra/outputs/openai_gpt-5-codex_2025-10-13T13-28-41.540Z.js diff --git a/tests/1_dijkstra/outputs/openai_gpt-5-codex_2025-10-13T13-28-41.540Z.js b/tests/1_dijkstra/outputs/openai_gpt-5-codex_2025-10-13T13-28-41.540Z.js deleted file mode 100644 index 921b069..0000000 --- a/tests/1_dijkstra/outputs/openai_gpt-5-codex_2025-10-13T13-28-41.540Z.js +++ /dev/null @@ -1 +0,0 @@ -async function findShortestPath(graph,start,end){const {default:PriorityQueue}=await import('https://cdn.jsdelivr.net/npm/js-priority-queue@latest/+esm');const distances=new Map(Object.keys(graph).map(node=>[node,Infinity]));distances.set(start,0);const visited=new Set();const pq=new PriorityQueue({comparator:(a,b)=>a[0]-b[0]});pq.queue([0,start]);while(pq.length){const [currentDistance,node]=pq.dequeue();if(visited.has(node))continue;if(node===end)return currentDistance;visited.add(node);for(const [neighbor,weight] of Object.entries(graph[node]||{})){const newDistance=currentDistance+weight;if(newDistance<(distances.get(neighbor)??Infinity)){distances.set(neighbor,newDistance);pq.queue([newDistance,neighbor]);}}}return Infinity;} \ No newline at end of file