Re: [igraph] igraph_get_shortest_paths() question

[Gábor Csárdi]

Paul,

I am not sure about use cases, but I think this is the most obvious
behavior. igraph could give an error message, or ignore the multiple
vertices, but both of these would be worse, I think.

E.g. imagine, you want to calculate shortest paths from a given
source, to two vertices, the one with the highest degree, and the one
with the highest betweenness (or whatever other selection criteria).
With the current implementation you don't need to handle the special
case when these vertices coincide.

Best,
Gabor

On Mon, Mar 14, 2011 at 10:41 AM, Paul Melis <address@hidden> wrote:
> Hi,
>
> I'm currently using igraph_get_shortest_paths() to find a path between two
> nodes. The "from" argument denotes a single vertex, while the "to" parameter
> can contain multiple vertices, including the same vertex multiple times.
> What is the use case for specifying a target vertex multiple times? Doing it
> doesn't seem to return different paths even if they exist in the graph (as
> mentioned in the documentation for igraph_get_shortest_paths()).
>
> Thanks,
> Paul
>
> _______________________________________________
> igraph-help mailing list
> address@hidden
> http://lists.nongnu.org/mailman/listinfo/igraph-help
>



-- 
Gabor Csardi <address@hidden>     UNIL DGM