Package com.jgalgo.alg.shortestpath

Class ShortestPathAllPairsFloydWarshall

java.lang.Object

com.jgalgo.alg.shortestpath.ShortestPathAllPairsAbstract

com.jgalgo.alg.shortestpath.ShortestPathAllPairsFloydWarshall

All Implemented Interfaces:

ShortestPathAllPairs

public class ShortestPathAllPairsFloydWarshall
extends ShortestPathAllPairsAbstract

The Floyd Warshall algorithm for all pairs shortest path.

Calculate the shortest path between each pair of vertices in a graph in \(O(n^3)\) time using \(O(n^2)\) space. Negative weights are supported.

Author:

Barak Ugav

Nested Class Summary

Nested classes/interfaces inherited from interface com.jgalgo.alg.shortestpath.ShortestPathAllPairs

ShortestPathAllPairs.Builder, ShortestPathAllPairs.IResult, ShortestPathAllPairs.Result<V,E>

Constructor Summary

Constructors

Constructor	Description
ShortestPathAllPairsFloydWarshall()	Create a APSP algorithm.

Method Summary

Methods inherited from class com.jgalgo.alg.shortestpath.ShortestPathAllPairsAbstract

computeAllShortestPaths, computeSubsetShortestPaths

Methods inherited from class java.lang.Object

equals, getClass, hashCode, notify, notifyAll, toString, wait, wait, wait

Constructor Details

ShortestPathAllPairsFloydWarshall

public ShortestPathAllPairsFloydWarshall()

Create a APSP algorithm.

Please prefer using ShortestPathAllPairs.newInstance() to get a default implementation for the ShortestPathAllPairs interface, or ShortestPathAllPairs.builder() for more customization options.