igraph-help
[Top][All Lists]
Advanced

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

Re: [igraph] All possible path between two nodes


From: Tamás Nepusz
Subject: Re: [igraph] All possible path between two nodes
Date: Mon, 25 Nov 2013 10:30:22 +0100

I got it to work but it is slow in a graph with only  7436 vertices. It is taking 3 hours so far and it has not terminated. What is the expectation as far as graph size is concerned?
There is no expectation; it depends on how many possible paths there are in your graph. (And I hope that your graph does not have cycles because that would mean an infinite number of paths). Why do you need all the possible paths anyway?

— 
T.

reply via email to

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