i condensed the graph and the value of each new node is the sum of the scc values so the graph supposed to be acyclic then i run dijkstra to find the maximum path by adding negative sign to the weights can anyone tell me what is wrong with my code here is the code https://ideone.com/VZvL6W and the link to the problem https://www.spoj.com/problems/GOODA/ Thanks in advance