[Date Prev][Date Next][Thread Prev][Thread Next][Date Index][Thread Index]
Re: [igraph] Shortest path with highest weights
From: |
Tamas Nepusz |
Subject: |
Re: [igraph] Shortest path with highest weights |
Date: |
Mon, 5 Jan 2015 22:58:16 +0100 |
User-agent: |
Mutt/1.5.23 (2014-03-12) |
> 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.
- Re: [igraph] Suggestion?, (continued)
Re: [igraph] Suggestion?, Tamas Nepusz, 2015/01/03
- Re: [igraph] Suggestion?, Herb Roseman, 2015/01/03
- [igraph] Shortest path with highest weights, Ragia Ibrahim, 2015/01/04
- Re: [igraph] Shortest path with highest weights, Chris Watson, 2015/01/04
- Re: [igraph] Shortest path with highest weights, Tamas Nepusz, 2015/01/04
- Re: [igraph] Shortest path with highest weights, Ragia Ibrahim, 2015/01/04
- Re: [igraph] Shortest path with highest weights, Matteo Fortini, 2015/01/05
- Re: [igraph] Shortest path with highest weights,
Tamas Nepusz <=
- Re: [igraph] Shortest path with highest weights, Matteo Fortini, 2015/01/05
Re: [igraph] Suggestion?, Tamas Nepusz, 2015/01/07
Re: [igraph] Suggestion?, Gábor Csárdi, 2015/01/14