V- the graph vertex type
E- the graph edge type
public class BhandariKDisjointShortestPaths<V,E> extends Object implements KShortestPathAlgorithm<V,E>
The algorithm is running $k$ sequential Bellman-Ford iterations to find the shortest path at each step. Hence, yielding a complexity of $k$*O(Bellman-Ford).
|Constructor and Description|
Creates an object to calculate $k$ disjoint shortest paths between the start vertex and others vertices.
|Modifier and Type||Method and Description|
Returns the $k$ shortest simple paths in increasing order of weight.
clone, equals, finalize, getClass, hashCode, notify, notifyAll, toString, wait, wait, wait
startVertex- source vertex of the calculated paths.
endVertex- target vertex of the calculated paths.
k- the number of shortest paths to return
IllegalArgumentException- if the graph does not contain the startVertex or the endVertex
IllegalArgumentException- if the startVertex and the endVertex are the same vertices
IllegalArgumentException- if the startVertex or the endVertex is null
Copyright © 2018. All rights reserved.