作业帮英语翻译不要用机器在线等You have n computers numbered from 1 to n and you want to connect them to make a small local area network (LAN). All connections are two-way (that is connecting computers i and j is the same as connecting computers
来源：学生作业帮助网 编辑：作业帮 时间：2024/04/30 02:46:26
英语翻译不要用机器在线等You have n computers numbered from 1 to n and you want to connect them to make a small local area network (LAN). All connections are two-way (that is connecting computers i and j is the same as connecting computers
英语翻译不要用机器在线等
You have n computers numbered from 1 to n and you want to connect them to make a small local area network (LAN). All connections are two-way (that is connecting computers i and j is the same as connecting computers j and i). The cost of connecting computer i and computer j is cij. You cannot connect some pairs of computers due to some particular reasons. You want to connect them so that every computer connects to any other one directly or indirectly and you also want to pay as little as possible.
Given n and each cij , find the cheapest way to connect computers.
Input
There are multiple test cases. The first line of input contains an integer T (T
英语翻译不要用机器在线等You have n computers numbered from 1 to n and you want to connect them to make a small local area network (LAN). All connections are two-way (that is connecting computers i and j is the same as connecting computers
你们有 n 计算机被从 1 总计到 n 和你想要连接他们制造一个小当地的区域网络 （区域网络）.所有连接是双行道的.（哪一正在连接计算机 i 和 j 相同于连接计算机 j 和 i）连接计算机 i 和计算机 j 的费用是 cij .你由于一些特别的理由不能够连接计算机的一些双.你想要连接他们,以便每部计算机直接地或者间接地连接至任何其他的,而且你也想要尽可能少支付.
给予的 n 和每 cij ,找最廉宜的方法连接计算机.
输入
有多个测试情形.输入的第一条线包含一个完整的事物 T（T ＜=100),指出测试情形的数字.然后 T 测试情形而起.
每个测试情形的第一条线包含一个完整的事物 n .（1< n ＜=100)然后 n 排成一行追从,每个哪一个包含因空间而分开的 n 完整的事物.i－th 的 j－th 完整的事物排成一行在这些 n 线是 cij,指出连接计算机 i 和 j 的费用.（cij ＝ 0个方法你不能够连接他们）0