|
|||||||||||
| PREV CLASS NEXT CLASS | FRAMES NO FRAMES | ||||||||||
| SUMMARY: NESTED | FIELD | CONSTR | METHOD | DETAIL: FIELD | CONSTR | METHOD | ||||||||||
java.lang.Object
|
+--net.walend.measured.AbstractShortestGEDistances
|
+--net.walend.measured.FloydWarshallShortestGEDistances
FloydWarshallShortestGEDistances uses the very simple Floyd-Warshall algorithm to find the shortest distances.
| Field Summary |
| Fields inherited from class net.walend.measured.AbstractShortestGEDistances |
|
| Constructor Summary | |
FloydWarshallShortestGEDistances(IndexedGEDigraph ceDigraph,
GEPathMeter pathMeter)
|
|
| Method Summary | |
private void |
floydWarshall()
|
void |
recalculate()
If the digraph is not valid, rediscover the shortest distances. |
| Methods inherited from class net.walend.measured.AbstractShortestGEDistances |
bfTest, getBase, getLength, getLength, getPathMeter, getPrincipleInterface, initializeDistances, relax, safeLength, sameStateAs, toString |
| Methods inherited from class java.lang.Object |
clone, equals, finalize, getClass, hashCode, notify, notifyAll, wait, wait, wait |
| Methods inherited from interface net.walend.measured.ShortestGEDistances |
getBase, getLength, getLength, getPathMeter |
| Methods inherited from interface net.walend.collection.HasState |
getPrincipleInterface, sameStateAs |
| Constructor Detail |
public FloydWarshallShortestGEDistances(IndexedGEDigraph ceDigraph,
GEPathMeter pathMeter)
throws GENegativeWeightCycleException
| Method Detail |
private void floydWarshall()
public void recalculate()
throws GENegativeWeightCycleException
recalculate in interface ShortestGEDistancesrecalculate in class AbstractShortestGEDistancesGENegativeWeightCycleException
|
|||||||||||
| PREV CLASS NEXT CLASS | FRAMES NO FRAMES | ||||||||||
| SUMMARY: NESTED | FIELD | CONSTR | METHOD | DETAIL: FIELD | CONSTR | METHOD | ||||||||||