/*
* (C) Copyright 2016-2017, by Dimitrios Michail 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 org.jgrapht.alg.interfaces;
import java.util.*;
import org.jgrapht.*;
/**
* An algorithm which computes k-shortest paths between vertices.
*
* @param the graph vertex type
* @param the graph edge type
*
* @author Dimitrios Michail
*/
public interface KShortestPathAlgorithm
{
/**
* Get a list of shortest paths from a source vertex to a sink vertex. If no such paths exist
* this method returns an empty list.
*
* @param source the source vertex
* @param sink the target vertex
* @return a list of shortest paths
*/
List> getPaths(V source, V sink);
}
Ads help maintain this website.