Docs: Update benchmark for anthropic/claude-opus-4.6 TEMP:0.4

tests/1_dijkstra/outputs/anthropic_claude-opus-4.6 TEMP_0.4.js

@@ -0,0 +1,38 @@
+async function findShortestPath(graph, start, end) {
+  const { default: PriorityQueue } = await import(
+    "https://cdn.jsdelivr.net/npm/js-priority-queue@0.4.1/+esm"
+  );
+
+  const dist = {};
+  for (const node in graph) dist[node] = Infinity;
+  dist[start] = 0;
+
+  const pq = new PriorityQueue({ comparator: (a, b) => a[1] - b[1] });
+  pq.queue([start, 0]);
+
+  const visited = new Set();
+
+  while (pq.length > 0) {
+    const [node, d] = pq.dequeue();
+
+    if (visited.has(node)) continue;
+    visited.add(node);
+
+    if (node === end) return d;
+
+    const neighbors = graph[node] || {};
+    for (const neighbor in neighbors) {
+      if (visited.has(neighbor)) continue;
+      const newDist = d + neighbors[neighbor];
+      if (newDist < dist[neighbor]) {
+        dist[neighbor] = newDist;
+        pq.queue([neighbor, newDist]);
+      }
+    }
+  }
+
+  return dist[end] ?? Infinity;
+}
+export default findShortestPath;
+// Generation time: 5.576s
+// Result: FAIL