Do you know efficient python algorithms $($methods$)$ for solving $1.$ minimal spanning tree problems and $2.$ maximum spanning tree if we have undirected network:

The network has nodes $1,2,...,$N and N$=1000.$

There is an arc between each pair of nodes. The weight of the arc between nodes a and b is min$($a$,$b$).$

$1.$How heavy is the smallest tuning tree in the network if n is $1000?($give number and Python algorithms $)$

$2.$How heavy is the largest tuning tree in the network if n is $1000?($give number and Python algorithms $)$