|
From: | Ananya Muddukrishna |
Subject: | Re: [igraph] Longest path calculation complains about negative edge weights |
Date: | Tue, 19 Nov 2013 21:30:19 +0100 |
User-agent: | Mozilla/5.0 (X11; Linux x86_64; rv:24.0) Gecko/20100101 Thunderbird/24.1.0 |
Thank you, Tamás, for the quick and
great reply!
I read about the longest path problem (http://en.wikipedia.org/wiki/Longest_path_problem) and did not find any limitations regarding negative weights in directed graphs. So technically, it should be possible to implement a function that supports negative weights on my own? I ask because I have a newcomers understanding of graph algorithms. On 11/19/2013 09:05 PM, Tamás Nepusz wrote: My example graph is directed with negated weights. So the second restriction you mention applies in my case.
Is negative-weight support planned for get.shortest.paths? I will stick with shortest.paths(algorithm=“bellman-ford”) for now. Best regards, Ananya Ananya Muddukrishna Ph.D. student KTH Royal Institute of Technology http://www.kth.se/profile/ananya/ |
[Prev in Thread] | Current Thread | [Next in Thread] |