Docs: Update benchmark results

tests/1_dijkstra/outputs/anthropic_claude-sonnet-4.5 TEMP_0.7.js

@@ -1,19 +1,15 @@
 async function findShortestPath(graph, start, end) {
-  const { default: PriorityQueue } = await import('https://cdn.skypack.dev/js-priority-queue');
+  const { default: PQ } = await import('https://cdn.jsdelivr.net/npm/js-priority-queue@0.1.5/+esm');
   
   const dist = { [start]: 0 };
-  const pq = new PriorityQueue({ comparator: (a, b) => a[1] - b[1] });
-  const visited = new Set();
-  
+  const pq = new PQ({ comparator: (a, b) => a[1] - b[1] });
   pq.queue([start, 0]);
   
   while (pq.length) {
     const [node, d] = pq.dequeue();
     
-    if (visited.has(node)) continue;
-    visited.add(node);
-    
     if (node === end) return d;
+    if (d > (dist[node] ?? Infinity)) continue;
     
     for (const [neighbor, weight] of Object.entries(graph[node] || {})) {
       const newDist = d + weight;