That's a good insight, thank you, Dr. Tamás! By looking at the data again, I found that I have records like this:
#gameinsight,happy happy,#gameinsight These are associations so the order does matter, but I am treating the network for the time being as undirected. I can also write a quick method to remove all edges and leave only one. But is there a better and more efficient way to built-in in igraph? Thanks very much again! -Ahmed On Sun, Dec 22, 2013 at 3:23 PM, Tamás Nepusz <[email protected]> wrote: > 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 > > [email protected] (mailto:[email protected]) > > https://lists.nongnu.org/mailman/listinfo/igraph-help > > > >
_______________________________________________ igraph-help mailing list [email protected] https://lists.nongnu.org/mailman/listinfo/igraph-help
