[Lemon-user] Listing all (shortest) paths between two vertices

[Alpar Juttner]

Hi,

Alas, LEMON provides nothing like that to date.
A version of the K shortest path algorithm is probably what you are
looking for.

Regards,
Alpár

On Sat, 2015-05-02 at 10:59 +0300, Jay wrote:
> Hi,
> 
> In some applications, it is needed to list all paths (or all shortest 
> paths) between two vertices s and t. Does LEMON have support for these 
> operations out of the box? So in particular, I am not interested in just 
> counting the paths, but explicitly enumerating them all, and doing some 
> operations on each such path.
> _______________________________________________
> Lemon-user mailing list
> Lemon-user at lemon.cs.elte.hu
> http://lemon.cs.elte.hu/mailman/listinfo/lemon-user
>