Very good catch thank you Il giorno lun 5 gen 2015 22:58 Tamas Nepusz <[email protected]> ha scritto:
> > Plus, you need to make sure that the graph has no cycles to be able to > use > > the shortest path algorithm to get the longest path > In this case I think it's not necessary -- since all the probabilities are > less > than or equal to 1, their logarithms will be all negative or zero. Then we > negate the logarithms, making them all non-negative, so in the end you have > a graph with non-negative weights only. Let me know if I misunderstood > something. > > T. > > _______________________________________________ > igraph-help mailing list > [email protected] > https://lists.nongnu.org/mailman/listinfo/igraph-help >
_______________________________________________ igraph-help mailing list [email protected] https://lists.nongnu.org/mailman/listinfo/igraph-help
