// Algtest is needed because Kruskal.java needs it.
import edu.gwu.algtest.*;
import edu.gwu.util.*;
import edu.gwu.debug.*;
import java.util.*;


public class CableSolver {

    // X[i], Y[i] are the (x,y) coordinates of the i-th point.
    // Return two numbers in the array that's returned: the first 
    // is the total cost of the all-to-all solution. The second is
    // the cost of the MST. Use your implementation of Kruskal's algorithm
    // to calculate the MST and then its cost.

    static double[] solve (double[] X, double[] Y)
    {
	// Write your code here.
    }

}