From 7c950bf7e9d3bfe2a5b604ff79ba773a48983650 Mon Sep 17 00:00:00 2001 From: multipleof4 Date: Mon, 13 Oct 2025 10:24:25 -0700 Subject: [PATCH] Delete: Old generated file format --- ...ude-sonnet-4.5_2025-10-13T13-27-10.378Z.js | 22 ------------------- 1 file changed, 22 deletions(-) delete mode 100644 tests/1_dijkstra/outputs/anthropic_claude-sonnet-4.5_2025-10-13T13-27-10.378Z.js diff --git a/tests/1_dijkstra/outputs/anthropic_claude-sonnet-4.5_2025-10-13T13-27-10.378Z.js b/tests/1_dijkstra/outputs/anthropic_claude-sonnet-4.5_2025-10-13T13-27-10.378Z.js deleted file mode 100644 index 44a2384..0000000 --- a/tests/1_dijkstra/outputs/anthropic_claude-sonnet-4.5_2025-10-13T13-27-10.378Z.js +++ /dev/null @@ -1,22 +0,0 @@ -async function findShortestPath(graph, start, end) { - const PriorityQueue = (await import('https://cdn.jsdelivr.net/npm/js-priority-queue@0.1.5/+esm')).default; - const distances = Object.keys(graph).reduce((acc, node) => ({ ...acc, [node]: Infinity }), {}); - distances[start] = 0; - const pq = new PriorityQueue({ comparator: (a, b) => a.distance - b.distance }); - pq.queue({ node: start, distance: 0 }); - const visited = new Set(); - while (pq.length > 0) { - const { node, distance } = pq.dequeue(); - if (visited.has(node)) continue; - visited.add(node); - if (node === end) return distance; - for (const [neighbor, weight] of Object.entries(graph[node] || {})) { - const newDistance = distance + weight; - if (newDistance < distances[neighbor]) { - distances[neighbor] = newDistance; - pq.queue({ node: neighbor, distance: newDistance }); - } - } - } - return distances[end]; -} \ No newline at end of file