| Package | Description |
|---|---|
| salvo.jesus.graph | |
| salvo.jesus.graph.adaptor | |
| salvo.jesus.graph.algorithm | |
| salvo.jesus.graph.listener |
| Modifier and Type | Field and Description |
|---|---|
protected GraphTraversal |
GraphImpl.traversal
Delegate object for implementing graph traversal.
|
| Modifier and Type | Method and Description |
|---|---|
GraphTraversal |
GraphImpl.getTraversal()
Gets the traversal algorithm used by the Graph.
|
GraphTraversal |
Graph.getTraversal()
Gets the traversal algorithm used by the Graph.
|
| Modifier and Type | Method and Description |
|---|---|
void |
GraphImpl.setTraversal(GraphTraversal traversal)
Sets the graph traversal algorithm to be used
|
void |
Graph.setTraversal(GraphTraversal traversal)
Sets the graph traversal algorithm to be used
|
| Modifier and Type | Method and Description |
|---|---|
GraphTraversal |
GraphDelegator.getTraversal() |
| Modifier and Type | Method and Description |
|---|---|
void |
GraphDelegator.setTraversal(GraphTraversal traversal) |
| Modifier and Type | Class and Description |
|---|---|
class |
BreadthFirstTraversal
A concrete subclass of GraphTraversal that uses breadth-first search
in traversing a graph.
|
class |
DepthFirstDirectedGraphTraversal
A concrete subclass of GraphTraversal that uses depth-first search in
traversing a directed graph.
|
class |
DepthFirstGraphTraversal
A concrete subclass of GraphTraversal that uses depth-first search in
traversing a graph.
|
class |
TopologicalSorting
A concrete subclass of GraphTraversal that performs a topological sort
against a directed acyclic graph.
|
| Modifier and Type | Class and Description |
|---|---|
class |
PathListener.PathTraversal |
| Modifier and Type | Method and Description |
|---|---|
GraphTraversal |
PathListener.getTraversal() |
Copyright © 2019 JULIE Lab, Germany. All rights reserved.