algorithm - Finding Shortest path in weighted directional multigraph with extra constraints -


given weighted directed multigraph, have find shortest path between starting vertex u vertex v. apart weight, each edge has time. path connecting u , v cannot take more given maximum time. trouble while using djikstra, there chances shortest path takes more time limit.

my approach find valid paths between u , v , minimize weight. approach not practical due high complexity.

any ideas?

if weights small enough

in case, can each node, store possible sums of weights can on path node. can dijsktra on new graph , try minimize time on nodes pairs (node, weight_sum).

if times small enough

you can same in previous example, on pairs (node, time).

general problem

i'm afraid in general can try possible paths, try improve prunning.


Popular posts from this blog

javascript - Js, document.getElementById("ID").innerHTML, error -

jquery - jqGrid update specific column data with out refreshing the entire column? -

objective c - Is there a way in OCMockito to make stubs fail when an unknown method is called? -