[Top][All Lists]

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

Re: [igraph] Finding paths

From: Tamas Nepusz
Subject: Re: [igraph] Finding paths
Date: Mon, 16 May 2011 10:36:37 +0200
User-agent: Mozilla/5.0 (X11; U; Linux x86_64; en-US; rv: Gecko/20110424 Lightning/1.0b2 Thunderbird/3.1.10

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):



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

reply via email to

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