| Package | Description |
|---|---|
| berack96.lib.graph | |
| berack96.lib.graph.impl | |
| berack96.lib.graph.view | |
| berack96.lib.graph.visit | |
| berack96.lib.graph.visit.impl |
| Modifier and Type | Method and Description |
|---|---|
VisitInfo<V> |
Vertex.visit(VisitStrategy strategy,
java.util.function.Consumer<V> visit)
Visit the graph from this current vertex with the strategy assigned
|
VisitInfo<V> |
Graph.visit(V source,
VisitStrategy<V,W> strategy,
java.util.function.Consumer<V> visit)
Visit the graph accordingly to the strategy that is passed.
This method visit the graph from the source to all the vertex that are reachable form the source. Some strategy can accept a source vertex null, because they visit all the graph anyway. |
| Modifier and Type | Method and Description |
|---|---|
VisitInfo<V> |
MatrixGraph.visit(V source,
VisitStrategy<V,W> strategy,
java.util.function.Consumer<V> visit) |
VisitInfo<V> |
MapGraph.visit(V source,
VisitStrategy<V,W> strategy,
java.util.function.Consumer<V> visit) |
VisitInfo<V> |
AdjGraph.visit(V source,
VisitStrategy<V,W> strategy,
java.util.function.Consumer<V> visit) |
| Constructor and Description |
|---|
VisitListener(GraphPanel<V,?> panel,
VisitStrategy<V,?> strategy) |
| Constructor and Description |
|---|
GraphInfo(GraphPanel<V,W> graphPanel,
VertexListener<V> vListener,
EdgeListener<V,W> eListener,
java.util.Set<VisitStrategy<V,W>> visits) |
| Modifier and Type | Interface and Description |
|---|---|
interface |
VisitDistance<V,W extends java.lang.Number>
Interface that is helpful for implements visit that needs to retrieve the distance between a vertex to all the others
|
interface |
VisitDistSourceDest<V,W extends java.lang.Number>
Interface that is helpful for implements visit that needs to retrieve the distance between a vertex to all the others
|
interface |
VisitSCC<V,W extends java.lang.Number>
Interface that is helpful for implements visit that needs to retrieve the SCC
|
interface |
VisitTopological<V,W extends java.lang.Number>
Interface that is helpful for implements visit that needs to retrieve the topological sort
|
| Modifier and Type | Class and Description |
|---|---|
class |
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. |
class |
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. |
class |
Dijkstra<V,W extends java.lang.Number>
Class that implements the Dijkstra algorithm and uses it for getting all the distance from a source
|
class |
Tarjan<V,W extends java.lang.Number>
Class that implements the Tarjan algorithm and uses it for getting the SCC and the topological sort
|