org.jgrapht.alg.interfaces.MinimumSpanningTree Maven / Gradle / Ivy
/* ==========================================
* JGraphT : a free Java graph-theory library
* ==========================================
*
* Project Info: http://org.org.jgrapht.sourceforge.net/
* Project Creator: Barak Naveh (http://sourceforge.net/users/barak_naveh)
*
* (C) Copyright 2003-2013, by Barak Naveh and Contributors.
*
* This program and the accompanying materials are dual-licensed under
* either
*
* (a) the terms of the GNU Lesser General Public License version 2.1
* as published by the Free Software Foundation, or (at your option) any
* later version.
*
* or (per the licensee's choosing)
*
* (b) the terms of the Eclipse Public License v1.0 as published by
* the Eclipse Foundation.
*/
/* -------------------------
* MinimumSpanningTree.java
* -------------------------
*
* Original Author: Alexey Kudinkin
* Contributor(s):
*
*/
package org.jgrapht.alg.interfaces;
import java.util.*;
/**
* Allows to derive
* minimum spanning tree from given undirected connected graph. In the case
* of disconnected graphs it would rather derive minimum spanning forest
*
* @param vertex concept type
* @param edge concept type
*/
public interface MinimumSpanningTree
{
/**
* Returns edges set constituting the minimum spanning tree/forest
*
* @return minimum spanning-tree edges set
*/
public Set getMinimumSpanningTreeEdgeSet();
/**
* Returns total weight of the minimum spanning tree/forest.
*
* @return minimum spanning-tree total weight
*/
public double getMinimumSpanningTreeTotalWeight();
}
// End MinimumSpanningTree.java