We use cookies to ensure you have the best browsing experience on our website. Please read our cookie policy for more information about how we use cookies.
functionbfs(n,m,edges,s){// Write your code hereconstgraph={}for(let[src,dest]ofedges){if(!graph[src]){graph[src]=[];}if(!graph[dest]){graph[dest]=[];}graph[src].push(dest)graph[dest].push(src)}console.log(graph)letdist=Array(n+1).fill(-1,1)letvisited=newSet()letqueue=[];queue.push(s);dist[s]=0visited.add(s)while(queue.length>0){letu=queue.shift();if(graph[u]){for(letchildofgraph[u]){if(!visited.has(child)){visited.add(child);dist[child]=dist[u]+6;queue.push(child);}}}console.log(queue)}dist.splice(s,1)console.log(dist)returnObject.values(dist)}
Cookie support is required to access HackerRank
Seems like cookies are disabled on this browser, please enable them to open this website
Breadth First Search: Shortest Reach
You are viewing a single comment's thread. Return to all comments →
My Javascript Code