Re: [igraph] Finding paths

[Tamas Nepusz]

Hi Moses,

Assuming that you mean all the paths (not just the shortest ones) that do
not contain the same vertex twice, this thread on Stack Overflow is a good
starting points (it's for Python, but it is easy to port it to other languages):

http://stackoverflow.com/questions/3971876/all-possible-paths-from-one-node-to-another-in-a-directed-tree-igraph

-- 
T.

On 05/16/2011 09:58 AM, Moses Boudourides wrote:
> Hi,
> 
> This might be easy but I would appreciate your support. Having the
> adjacency matrix of a graph, how could I find the paths (NOT walks)
> between any two nodes? Actually, for each pair of nodes, I'd like to
> have all possible lengths of the existing paths joining them.
> 
> Best,
> 
> --Moses
> 
> _______________________________________________
> igraph-help mailing list
> address@hidden
> https://lists.nongnu.org/mailman/listinfo/igraph-help
>