multipleof4/lynchmark
1
0
Fork 0
mirror of https://github.com/multipleof4/lynchmark.git synced 2026-01-14 16:47:55 +00:00
Code Issues Packages Projects Releases Wiki Activity

Delete: Old generated file format

Browse Source
This commit is contained in:
multipleof4
2025-10-13 10:24:25 -07:00
parent fdd4654843
commit 7c950bf7e9
1 changed files with 0 additions and 22 deletions
Download Patch File Download Diff File Expand all files Collapse all files

22
tests/1_dijkstra/outputs/anthropic_claude-sonnet-4.5_2025-10-13T13-27-10.378Z.js
View File

@@ -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];
}