com.salesforce.jgrapht.alg.interfaces.MinimumSpanningTree Maven / Gradle / Ivy

Go to download

Show more of this group Show more artifacts with this name
Show all versions of AptSpringProcessor Show documentation

This project contains the apt processor that implements all the checks enumerated in @Verify. It is a self contained, and shaded jar.

There is a newer version: 2.0.7

Show newest version

/*
 * (C) Copyright 2013-2017, by Alexey Kudinkin and Contributors.
 *
 * JGraphT : a free Java graph-theory library
 *
 * 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.
 */
package com.salesforce.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
 * @deprecated In favor of {@link SpanningTreeAlgorithm}.
 */
@Deprecated
public interface MinimumSpanningTree
{
    /**
     * Returns edges set constituting the minimum spanning tree/forest
     *
     * @return minimum spanning-tree edges set
     */
    Set getMinimumSpanningTreeEdgeSet();

    /**
     * Returns total weight of the minimum spanning tree/forest.
     *
     * @return minimum spanning-tree total weight
     */
    double getMinimumSpanningTreeTotalWeight();
}

// End MinimumSpanningTree.java