MostafaM.Galal's blog

By MostafaM.Galal, history, 19 months ago, In English

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

  • Vote: I like it
  • 0
  • Vote: I do not like it

»
19 months ago, # |
  Vote: I like it 0 Vote: I do not like it

Auto comment: topic has been updated by MostafaM.Galal (previous revision, new revision, compare).