import java.util.*;

/**
 * An implementation of tree search based on Kruskal.
 */
public class Kruskal
{
	/**
	 *
	 * @param <V> The type for the vertices in the graph.
	 * @param <E> The type for edges in the graph.
	 * @param g The graph in which to search
	 * @return The list of edges in the minimum spanning tree.
	 */
	public <V,E extends Edge<V>> List<E> minimumSpanningTree(GraphInterface<V,E> g)
	{
		return null;
	}
}