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

Docs: Update Gemini benchmark results

Browse Source
This commit is contained in:
github-actions[bot]
2025-11-18 22:04:41 +00:00
parent 31a18dd4ee
commit 33b8150958
220 changed files with 3259 additions and 1494 deletions
Download Patch File Download Diff File Expand all files Collapse all files

39
tests/1_dijkstra/outputs_gemini/gemini-3-pro-preview TEMP_0.3.js
View File

@@ -1,20 +1,25 @@
const findShortestPath = async (g, s, e) => {
const { default: P } = await import('https://esm.sh/js-priority-queue')
const q = new P({ comparator: (a, b) => a.w - b.w })
const m = { [s]: 0 }
q.queue({ n: s, w: 0 })
while (q.length) {
const { n, w } = q.dequeue()
if (n === e) return w
if (w > (m[n] ?? 1 / 0)) continue
for (const k in g[n] || {}) {
const t = w + g[n][k]
if (t < (m[k] ?? 1 / 0)) {
m[k] = t
q.queue({ n: k, w: t })
}
const { default: P } = await import('https://cdn.jsdelivr.net/npm/js-priority-queue@0.1.5/+esm');
const q = new P({ comparator: (a, b) => a.w - b.w });
const d = { [s]: 0 };
q.queue({ n: s, w: 0 });
while (q.length) {
const { n, w } = q.dequeue();
if (n === e) return w;
if (w > (d[n] ?? 1/0)) continue;
for (let v in g[n]) {
let k = w + g[n][v];
if (k < (d[v] ?? 1/0)) {
d[v] = k;
q.queue({ n: v, w: k });
}
}
}
}
return 1 / 0
}
return 1/0;
};
export default findShortestPath;