Re: [igraph] Finding paths

[Tamas Nepusz]

The bottom line of that thread is that this functionality is not built-in
into igraph, so you have to brew your own solution -- but it's pretty easy
to do in a recursive manner. Of course it will work only for small graphs
because the number of paths simply becomes too large for larger graphs.

-- 
T.

On 05/16/2011 10:42 AM, Moses Boudourides wrote:
> Thanks, Tamas. Python is okay, although I would prefer R igraph. But I
> guess, I can still try to find my way around.
> 
> Best,
> 
> --Moses
> 
> On Mon, May 16, 2011 at 10:36 AM, Tamas Nepusz <address@hidden> wrote:
>> 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
>>>
>>
>> _______________________________________________
>> igraph-help mailing list
>> address@hidden
>> https://lists.nongnu.org/mailman/listinfo/igraph-help
>>
> 
> _______________________________________________
> igraph-help mailing list
> address@hidden
> https://lists.nongnu.org/mailman/listinfo/igraph-help
>