graph theory - Suurballe's algorithm for k-best -
i'm interesting in adapting suurballe's algorithm find best k paths source destination instead of 2 best. think people time i've been searching hours , can't find paper explains clearly. there's reference paper on suurballe's wikipedia page talks it, gives no detail on extension past first 2 (how graph modified , results merged, etc.). incidentally, i'm working on vertex-disjoint problem, not edge disjoint problem spelled out on wikipedia.
my concise question: how extend suurballe's algorithm beyond 2 paths?
in literature called successive shortest paths problem, , works in same way, repeated. modify each discovered path's weights in same way modified first.
Comments
Post a Comment