T
- node type in the graphpublic class FloydWarshall<T> extends Object
Modifier and Type | Class and Description |
---|---|
static interface |
FloydWarshall.GetPath<T> |
static interface |
FloydWarshall.GetPaths<T> |
Modifier and Type | Field and Description |
---|---|
protected NumberedGraph<T> |
G |
Constructor and Description |
---|
FloydWarshall(NumberedGraph<T> g) |
Modifier and Type | Method and Description |
---|---|
static <T> FloydWarshall.GetPath<T> |
allPairsShortestPath(NumberedGraph<T> G) |
int[][] |
allPairsShortestPaths() |
static <T> FloydWarshall.GetPaths<T> |
allPairsShortestPaths(NumberedGraph<T> G) |
protected int |
edgeCost(int from,
int to) |
protected void |
pathCallback(int i,
int j,
int k) |
static <T> int[][] |
shortestPathLengths(NumberedGraph<T> G) |
protected final NumberedGraph<T> G
public FloydWarshall(NumberedGraph<T> g)
protected int edgeCost(int from, int to)
protected void pathCallback(int i, int j, int k)
public int[][] allPairsShortestPaths()
public static <T> int[][] shortestPathLengths(NumberedGraph<T> G)
public static <T> FloydWarshall.GetPath<T> allPairsShortestPath(NumberedGraph<T> G)
public static <T> FloydWarshall.GetPaths<T> allPairsShortestPaths(NumberedGraph<T> G)