|
||||||||||
| PREV NEXT | FRAMES NO FRAMES | |||||||||
| Packages that use TraversalGraph | |
|---|---|
| org.javanetworkanalyzer.alg | |
| Uses of TraversalGraph in org.javanetworkanalyzer.alg |
|---|
| Methods in org.javanetworkanalyzer.alg that return TraversalGraph | |
|---|---|
TraversalGraph<V,E> |
GraphSearchAlgorithm.reconstructTraversalGraph()
|
TraversalGraph<V,E> |
TraversalAlg.reconstructTraversalGraph()
Returns the SPT (BFS/Dijkstra) or traversal graph (DFS) from the last start node TraversalAlg.calculate(V) was called on. |
TraversalGraph<V,E> |
Dijkstra.reconstructTraversalGraph(double radius)
Returns the SPT from the last start node Dijkstra.calculate(V) was called on,
limited by the given radius. |
|
||||||||||
| PREV NEXT | FRAMES NO FRAMES | |||||||||