[Top][All Lists]
[Date Prev][Date Next][Thread Prev][Thread Next][Date Index][Thread Index]
Re: [igraph] All paths between all existing nodes of a network
|
From: |
Tamas Nepusz |
|
Subject: |
Re: [igraph] All paths between all existing nodes of a network |
|
Date: |
Wed, 14 Apr 2010 07:40:35 +0100 |
Dear Anupam,
> Apologies for asking a question which has already been asked before. Is there
> any way of finding all the paths (not just the shortest paths) between all
> pairs of nodes of a network "programmatically"
Are you sure you want to do that? If your graph is connected and contains at
least a single cycle, then the number of all the paths between any two nodes
will be infinite as you may traverse the cycle as many times as you want.
--
Tamas