|
MATES 3.0-rc2 | ||||||||||
PREV CLASS NEXT CLASS | FRAMES NO FRAMES | ||||||||||
SUMMARY: NESTED | FIELD | CONSTR | METHOD | DETAIL: FIELD | CONSTR | METHOD |
java.lang.Object org.mates.sim.network.Topology.AllPairsShortestPathData
Class containing both the distances and route table for the shortest path between all pairs of hosts.
Constructor Summary | |
Topology.AllPairsShortestPathData(double[][] distances,
int[][] predecessors)
Constructs the all pairs shortest path information from a matrix of geodesic distances and a predecessor matrix. |
Method Summary | |
double[][] |
getDistances()
Returns an n xn matrix where
n == getNumHosts() and entry i,j
corresponds to the distance of the shortest path from host
i to host j . |
int[][] |
getPredecessors()
Returns an n xn matrix where
n == getNumHosts() and entry i,j
corresponds to the predecessor of j in the
shortest path from host i to host
j . |
int[] |
getRoute(int i,
int j)
Convenience function that calls Topology.getRoute(int[][], int, int) on the current
predecessor matrix. |
int[][] |
getRoutes()
Returns an n xn matrix where
n == getNumHosts() and entry i,j
corresponds to the next host in the shortest path from host
i to host j . |
Methods inherited from class java.lang.Object |
clone, equals, finalize, getClass, hashCode, notify, notifyAll, toString, wait, wait, wait |
Constructor Detail |
public Topology.AllPairsShortestPathData(double[][] distances, int[][] predecessors)
Method Detail |
public double[][] getDistances()
n
xn
matrix where
n == getNumHosts()
and entry i,j
corresponds to the distance of the shortest path from host
i
to host j
. These entries may
include Double.POSITIVE_INFINITY
, if the
graph is not connected.
public int[] getRoute(int i, int j)
Topology.getRoute(int[][], int, int)
on the current
predecessor matrix.
public int[][] getRoutes()
n
xn
matrix where
n == getNumHosts()
and entry i,j
corresponds to the next host in the shortest path from host
i
to host j
. This route table
may include loops (but not cycles) if the graph is not
connected.
public int[][] getPredecessors()
n
xn
matrix where
n == getNumHosts()
and entry i,j
corresponds to the predecessor of j
in the
shortest path from host i
to host
j
. This predecessor matrix may include loops
(but not cycles) if the graph is not connected.
|
MATES 3.0-rc2 | ||||||||||
PREV CLASS NEXT CLASS | FRAMES NO FRAMES | ||||||||||
SUMMARY: NESTED | FIELD | CONSTR | METHOD | DETAIL: FIELD | CONSTR | METHOD |