[Top][All Lists]
[Date Prev][Date Next][Thread Prev][Thread Next][Date Index][Thread Index]
Re: [igraph] find all paths from multiple sources
|
From: |
Tamas Nepusz |
|
Subject: |
Re: [igraph] find all paths from multiple sources |
|
Date: |
Fri, 09 Dec 2011 14:06:37 +0100 |
|
User-agent: |
Mozilla/5.0 (X11; Linux x86_64; rv:8.0) Gecko/20111124 Thunderbird/8.0 |
> Excuse me if this has been already answered, but I was wondering
> whether igraph has any functions for the longest path problem in
> certain situations where an algorithm can be implemented approximately
> since this an NP-complete problem?
As far as I know, there are no such functions in igraph (apart from
topological sorting, which could be useful for the longest path problem if
your graph is a DAG).
Cheers,
Tamas