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 benchmark results

Browse Source
This commit is contained in:
github-actions[bot]
2025-11-18 17:37:06 +00:00
parent 39d057f079
commit afcfd09537
84 changed files with 1086 additions and 1088 deletions
Download Patch File Download Diff File Expand all files Collapse all files

21
tests/1_dijkstra/outputs/openrouter_sherlock-think-alpha.js
View File

@@ -1,19 +1,20 @@
async function findShortestPath(graph,start,end){
const{PriorityQueue}=await import('https://cdn.skypack.dev/js-priority-queue');
const{default:PriorityQueue}=await import('https://cdn.skypack.dev/js-priority-queue');
const dist={};
for(let n in graph)dist[n]=Infinity;
const pq=new PriorityQueue({comparator:(x,y)=>x.d-y.d});
for(const n of Object.keys(graph))dist[n]=Infinity;
dist[start]=0;
const pq=new PriorityQueue({comparator:(a,b)=>a.d-b.d});
pq.queue({node:start,d:0});
pq.queue({n:start,d:0});
while(!pq.isEmpty()){
const{node,d}=pq.dequeue();
if(d>dist[node])continue;
if(node===end)return d;
for(let nei in graph[node]){
const alt=d+graph[node][nei];
const{n:n,d:d}=pq.dequeue();
if(d>dist[n])continue;
if(n===end)return d;
for(let nei in graph[n]){
const w=graph[n][nei];
const alt=d+w;
if(alt<dist[nei]){
dist[nei]=alt;
pq.queue({node:nei,d:alt});
pq.queue({n:nei,d:alt});
}
}
}