dynamic dijstra

  • 0

    given a gragh,with a huge number(n) of node and each node dont have too many edges and the edge length often changes,and take the node o as the start node.using dijstra algorithm we could get the best pathway to reach every node from o.
    now change one edge's length,and clearly the bestway changes.to repeat dijstra the cost is O(E+VlgV),and clearly not necesary.so what can we do to adjust in better way.

    thanks for reply and forgive my poor english

Log in to reply

Looks like your connection to LeetCode Discuss was lost, please wait while we try to reconnect.