multipleof4/lynchmark
1
0
Fork 0
mirror of https://github.com/multipleof4/lynchmark.git synced 2026-01-14 00:27: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

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

@@ -1,22 +1,22 @@
const findShortestPath = async (g, s, e) => {
const { default: Q } = await import('https://esm.sh/js-priority-queue')
const q = new Q({ comparator: (a, b) => a.w - b.w })
const { default: PQ } = await import('https://esm.sh/js-priority-queue')
const q = new PQ({ 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
if (w > (d[n] ?? Infinity)) continue
for (let v in g[n]) {
let t = w + g[n][v]
if (t < (d[v] ?? 1/0)) {
d[v] = t
q.queue({ n: v, w: t })
let k = w + g[n][v]
if (k < (d[v] ?? Infinity)) {
d[v] = k
q.queue({ n: v, w: k })
}
}
}
return 1/0
return Infinity
}
export default findShortestPath;