|
|||||||||||
| PREV NEXT | FRAMES NO FRAMES | ||||||||||
| Packages that use net.walend.measured | |
| net.walend.measured | This package contains a kit for working with measured paths on directed graphs. |
| net.walend.measured.test | This package contains a kit for testing measuring paths. |
Classes in net.walend.measured used by net.walend.measured| AbstractShortestCEDistances
|
AbstractShortestCEDistances contains a 2D array of distances between nodes in a directed graph. AbstractShortestCEPaths
|
AbstractShortestCEPaths is a CEDigraph containing the nodes from the base digraph and edges that are the shortest paths between some pairs of nodes. AbstractShortestCEPaths.MeasuredEdge
|
AbstractShortestGEDistances
|
AbstractShortestGEDistances contains a 2D array of distances between nodes in a directed graph. AbstractShortestGEPaths
|
AbstractShortestGEPaths is a CEDigraph containing the nodes from the base digraph and edges that are the shortest paths between some pairs of nodes. AbstractShortestGEPaths.MeasuredEdge
|
CEBellmanFordTest.BFEdge
|
A marker object used in the bellman-ford algorithm. CEBellmanFordTest.BFNode
|
A marker object used in the bellman-ford algorithm. CENegativeWeightCycleException
|
An exception thrown by the Bellman-Ford test. CEPathMeter
|
PathMeters measure the cost to enter and leave nodes and cross edges. CEPathsFromShortestDistances
|
CEPathsFromShortestDistances wraps a ShortestCEDistances object to provide a full ShortestCEPaths interface. CEPathsFromShortestDistances.MeasuredEdge
|
DijkstraShortestCEDistances
|
DijkstraShortestCEDistances is an abstract class that holds Dijkstra's algorithm. DijkstraShortestCEDistances.HeapNode
|
DijkstraShortestCEPaths
|
DijkstraShortestCEPaths is an abstract class that contains Dijkstra's algorithm for shortest paths, plus supporting code for solutions with nodes must go inside a hash table. DijkstraShortestCEPaths.HeapNode
|
DijkstraShortestGEDistances
|
DijkstraShortestGEDistances is an abstract class that holds Dijkstra's algorithm. DijkstraShortestGEDistances.HeapNode
|
DijkstraShortestGEPaths
|
DijkstraShortestGEPaths is an abstract class that contains Dijkstra's algorithm for shortest paths, plus supporting code for solutions with nodes must go inside a hash table. DijkstraShortestGEPaths.HeapNode
|
GEBellmanFordTest.BFNode
|
A marker object used in the bellman-ford algorithm. GENegativeWeightCycleException
|
An exception thrown by the Bellman-Ford test. GEPathMeter
|
PathMeters measure the cost to enter and leave nodes and cross edges. MeasuredCEPath
|
MeasuredGEPath
|
MeasuredPathException
|
NegativeWeightCycleException
|
An exception thrown by the Bellman-Ford test. PathMeter
|
Deprecated. Use CEPathMeter. ShortestCEDistances
|
This interface describes methods to find the shortest distances on a CE digraph. ShortestCEPaths
|
This interface is a DigraphOfCEPaths that contains the shortest paths in available in the base digraph as measured by a PathMeter. ShortestGEDistances
|
This interface describes methods to find the shortest distances on a GE digraph. ShortestGEPaths
|
This interface is a DigraphOfGEPaths that contains the shortest paths in available in the base digraph as measured by a PathMeter. SimpleCEPathMeter
|
This simple path meter returns 1 for the cost to cross an edge and 0 for everything else. TieBreaker
|
TieBreakers break ties when finding paths within CEPathsFromShortestDistances and GEPathsFromShortestDistances. |
|
Classes in net.walend.measured used by net.walend.measured.test| CENegativeWeightCycleException
|
An exception thrown by the Bellman-Ford test. CEPathMeter
|
PathMeters measure the cost to enter and leave nodes and cross edges. GENegativeWeightCycleException
|
An exception thrown by the Bellman-Ford test. GEPathMeter
|
PathMeters measure the cost to enter and leave nodes and cross edges. MeasuredCEPath
|
ShortestCEDistances
|
This interface describes methods to find the shortest distances on a CE digraph. ShortestCEPaths
|
This interface is a DigraphOfCEPaths that contains the shortest paths in available in the base digraph as measured by a PathMeter. ShortestGEDistances
|
This interface describes methods to find the shortest distances on a GE digraph. ShortestGEPaths
|
This interface is a DigraphOfGEPaths that contains the shortest paths in available in the base digraph as measured by a PathMeter. TieBreaker
|
TieBreakers break ties when finding paths within CEPathsFromShortestDistances and GEPathsFromShortestDistances. |
|
|
|||||||||||
| PREV NEXT | FRAMES NO FRAMES | ||||||||||