In shlomi rubinstein pdf file there are two questions talking about finding MST in some graph G, that its edges weights are bounded in a known range: 7, 19.

In question 7, he says it's better to use prim and gives an algorithm with constant number of queues, but in question 19 he doesn't use this algorithm and just uses kruskal with a little worse complexity (not linear).

Is one of them wrong? is there some difference between them?

Thanks,

Moran.