Обсуждение @ 1160. Network @ Timus Online Judge

which MST algo do you prefer

Послано tiancaihb 14 сен 2009 04:11

well, i like prim better

Re: which MST algo do you prefer

Послано qltedxtc 24 окт 2009 12:39

I prefer prim,too.

Re: which MST algo do you prefer

Послано sos1g3 [TSOGU] 22 ноя 2009 19:21

imho cruscal... =)

Re: which MST algo do you prefer

Послано Oleg Strekalovsky [Vologda SPU] 29 мар 2010 00:28

I think, that this problem can be solved without MST.
Just use binary search by maximum of single cable length and check accessibility of every node of graph. NlogM :)

Re: which MST algo do you prefer

Послано Mak✭kbtu 15 сен 2010 16:24

I like Kruskal's algo, as it is easy to implement it using disjoint set systems with O(n*logn) running time.

Re: which MST algo do you prefer

Послано hoan 25 ноя 2010 21:14

i think prim is better

Обсуждение задачи 1160. Network