algorithm - Find the minimize maximum weights in weighted graph using dynamic programming -
i'm looking algorithm finds path 2 vertices s t, in graph has k edges if paths exist.
and if multiple paths found, 1 minimum maximum weights of single edge preferred. (not overall weights).
eg: k = 5
path 1: s - - b - c - d - t weights 1 - 1 - 1 - 10 - 1
the maximum weight of path 1 10
path 2: s - x - y - z - w - t weights 7 - 9 - 8 - 6 - 7
the maximum weight of path 2 9, preferred.
how solve problem?
you use modified version of floyd-warshal algorithm iterates k steps , forces path lengths (by removing min
part)
Comments
Post a Comment