| Class | Description |
|---|---|
| BFS<V,W extends java.lang.Number> |
Breadth-first search
The algorithm starts at the root node and explores all of the neighbor nodes at the present depth prior to moving on to the nodes at the next depth level. |
| DFS<V,W extends java.lang.Number> |
Depth-first search
The algorithm starts at the root node and explores as far as possible along each branch before backtracking. |
| Dijkstra<V,W extends java.lang.Number> |
Class that implements the Dijkstra algorithm and uses it for getting all the distance from a source
|
| Tarjan<V,W extends java.lang.Number> |
Class that implements the Tarjan algorithm and uses it for getting the SCC and the topological sort
|
| VisitInfo<V> |
The class used for getting the info of the visit.
It could be used with the algorithm of the visit for set some useful data. |