WA on EZDIJKST

[jimmyl02]

Hi I am trying to complement dijkstra and using various test cases it seems right. Can anyone point out to me why it is giving WA? Is it an edge case?

[edit] I took out the code bc I got answer accepted. If you are interested in my solution feel free to ask me

[simes]

if(!visited[adjList[nodeNum][i].first] && adjList[nodeNum][i].second + cost < dist[adjList[nodeNum][i].first]){
pq.push(make_pair(adjList[nodeNum][i].first, (dist[adjList[nodeNum][i].first] = adjList[nodeNum][i].second + cost)));

Take another look at those lines.

[jimmyl02]

Any chance you can be more specific? To me this looks right

[simes]

What is held in first and what is in second? Why would you assign one to the other?

[jimmyl02]

first is the node number, second is the cost to that node. In that line I am setting the distance in the dist array using the node number and getting the cost from second.

[jimmyl02]

omg I just found the problem. I forgot to add an endline if the answer wasn’t no

[simes]

Yep. I was barking up the wrong tree entirely.