[Top][All Lists]

[Date Prev][Date Next][Thread Prev][Thread Next][Date Index][Thread Index]

Re: [igraph] Paths in multigraphs

From: Gábor Csárdi
Subject: Re: [igraph] Paths in multigraphs
Date: Wed, 14 Aug 2013 11:10:47 -0400

I assume your graphs are weighted. Then just calculate the vertices along the shortest paths with get.all.shortest.paths, and then go over the pairs of vertices along the paths and for each pair choose the edge with the smallest weight. If multiple edges have the same weight, then you have multiple shortest paths there. 


On Tue, Aug 13, 2013 at 5:11 AM, David Edwards <address@hidden> wrote:

I am working with multigraphs (multiple edges between node-pairs) and would like to extract all shortest paths between two given nodes. Since these are multigraphs the paths should be edge sequences rather than node sequences. This seems to fall in between get.shortest.paths, which can return edge sequences, but just for one shortest path, and get.all.shortest.paths, which returns all shortest paths, but only as node sequences. Any suggestions?



igraph-help mailing list

reply via email to

[Prev in Thread] Current Thread [Next in Thread]