[Lemon-user] Dijkstra's on multiple source shortest path

[Wei Liu]

Dear Lemon users,

When I read Dijkstra's algorithm in Lemon (
http://lemon.cs.elte.hu/pub/tutorial/a00010.html#sec_shortest_paths), I
found it can add additional source by

dijkstra<http://lemon.cs.elte.hu/pub/doc/1.2.3/a00531.html#ga6aa57523fe00e2b8fe2f5cd17dd15cea>
.addSource(s);

But I don't quite understand what the definition of the multiple source
shortest path (MSSP). Do I get a distance map, where each target node have
a minimal distance over the possible path from multiple sources?

Also what is the computation time of the multiple source problem compared
to the single source one?

A quick search online gave me results of the MSSP on planar graph. Is it a
well defined problem for general directed graph?

Thanks,
Wei
University of Utah
-------------- next part --------------
An HTML attachment was scrubbed...
URL: <http://lemon.cs.elte.hu/pipermail/lemon-user/attachments/20140213/1df4cf35/attachment.html>