mirror of
https://github.com/multipleof4/lynchmark.git
synced 2026-01-14 00:27:55 +00:00
24 lines
549 B
JavaScript
24 lines
549 B
JavaScript
export const findShortestPath=async(g,s,e)=>{
|
|
const{default:Q}=await import('https://esm.sh/js-priority-queue')
|
|
const d={},v=new Set(),q=new Q({comparator:(a,b)=>a[1]-b[1]})
|
|
for(const k in g)d[k]=Infinity
|
|
d[s]=0
|
|
q.queue([s,0])
|
|
while(q.length){
|
|
const[n,w]=q.dequeue()
|
|
if(v.has(n))continue
|
|
if(n===e)return w
|
|
v.add(n)
|
|
for(const[nb,c]of Object.entries(g[n]||{})){
|
|
const nw=w+c
|
|
if(nw<d[nb]){
|
|
d[nb]=nw
|
|
q.queue([nb,nw])
|
|
}
|
|
}
|
|
}
|
|
return Infinity
|
|
}
|
|
export default findShortestPath;
|
|
// Generation time: 9.436s
|
|
// Result: PASS
|