igraph-help
[Top][All Lists]
Advanced

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

Re: [igraph] Redundant paths when called g2.get_all_shortest_paths()


From: Tamás Nepusz
Subject: Re: [igraph] Redundant paths when called g2.get_all_shortest_paths()
Date: Sun, 22 Dec 2013 21:23:27 +0100

Hi, 

Do you have multiple edges between vertices 10 and 98, or between vertices 98 
and 89? 

-- 
T.


On Sunday, 22 December 2013 at 21:18, Ahmed Abdeen Hamed wrote:

> Hello friends,
> 
> I am getting many redundant instances for the same path when called the 
> g2.get_all_shortest_paths(): 
> 
> Various PATH are: [[10, 98, 89], [10, 98, 89], [10, 98, 89], [10, 98, 89]]
> 
> I made sure that my data does not have redundant nodes but the problem still 
> persists. 
> 
> Is this a common problem? I can share my data and code if needed.
> 
> Sincerely,
> 
> -Ahmed 
> _______________________________________________
> igraph-help mailing list
> address@hidden (mailto:address@hidden)
> https://lists.nongnu.org/mailman/listinfo/igraph-help






reply via email to

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