Fear_Is_An_Illusion's blog

will modify dijsktra work for this problem ?
By Fear_Is_An_Illusion, history, 9 years ago, In English

hello, in this sum question I have been trying to implement a modified dijsktra but fail. I just want to know if modified dijsktra work here.

please don't give further hints

  • Vote: I like it
  • -4
  • Vote: I do not like it

»
9 years ago, # |
  Vote: I like it 0 Vote: I do not like it

I am not sure what you mean by modified Dijkstra,
but I did solve it with Dijkstra.

→ Reply
  • »
    »
    9 years ago, # ^ |
      Vote: I like it 0 Vote: I do not like it

    thanks, i will try more .. modified dijsktra means it has slight modification .. okay sorry if it confuses

    → Reply
    • »
      »
      »
      9 years ago, # ^ |
        Vote: I like it 0 Vote: I do not like it

      Good luck :)

      → Reply
      • »
        »
        »
        »
        9 years ago, # ^ |
        ← Rev. 2   Vote: I like it 0 Vote: I do not like it

        so, earlier I was trying to just use some kind of hash to track the weights. but then I realised, I could just stotre the nodes of shortest path and take 2 consecutive nodes and mark the precomputed hashng of edges with those 2 vertices as true.. then just print indices of vertices which are false after getting all shortest paths..

        what did u do

        → Reply
        • »
          »
          »
          »
          »
          9 years ago, # ^ |
          ← Rev. 4   Vote: I like it +3 Vote: I do not like it

          My solution doesn't have hashing actually.

          What I did was: do a All-Pairs Shortest Path by using Dijkstra V times.
          Then I enumerate through each edge, and see if the shortest path between any pairs of nodes pass that edge.

          The whole solution works in O(V3 + E * V2).
          The complexity is kind of lousy, but we have 8 minutes to work with.

          → Reply