All geek questions in one place

The algorithm for finding the minimum spanning tree when the cost is specified by multiplying the weights of the edges

Recently I was asked if I can find an algorithm for calculating the minimum cost binding tree for this graph, where the total cost of the spanning tree is determined by the product of regional costs, and not by their sum.

There are several algorithms for computing a regular mini-spanning tree, but I'm not sure how to configure them for the case mentioned above. Any ideas?

Thank.

+3
source share
3 answers

log ( ) = (log ( )), log- - .

+17

, , , . : MST .

, Google. , . .

+4

. ( ), , , .

( ) - bc . ( ? - 1 , 1 . !)

, . -, ( 1), . -, c ^ 2? , , , ""

0

Source: https://habr.com/ru/post/1775712/

More articles:


All Articles