Docs: Update Gemini benchmark results

tests/1_dijkstra/outputs_gemini/gemini-3-pro-preview TEMP_0.5.js

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