I'm trying to do some calculation on a non-directed, cyclical, weighted graph, and I have an overall weight Good job to calculate.
The value of the distance in each border range [1, ∞] is the algorithm should give more importance to the lesser distance (it should decrease monotonically), and it should assign value 0 for the distance 0 .
My first trend was only 1 / d, which meets the requirements of both of them. (Well, technically 1 / ∞ is undefined, but the programmers want to let the same slide go more easily than the mathematicians.) The problem with 1 / D is that the function is between 1/1 and 1/2 I pay more attention to the difference between 1/34 and 1/35 I would also like to do a bit more √ (1 / d) or ∛ (1 / d) or even ∜ (1 / D), but I think I lose a whole class of possibilities I am here. any suggestion?
(I was thinking about LN (1 / D), but it goes- D goes as D, and I think there is not a good way to grow up to 0 .)
:
I forgot a need: w (1) 1 should be. (This does not invalidate the existing answers, a multiplier is continuously fine.)
How about 1 / ln (d + k)?
Comments
Post a Comment