Uses of Class
dev.nm.graph.algorithm.traversal.GraphTraversal.Node
-
Packages that use GraphTraversal.Node Package Description dev.nm.graph.algorithm.traversal -
-
Uses of GraphTraversal.Node in dev.nm.graph.algorithm.traversal
Subclasses of GraphTraversal.Node in dev.nm.graph.algorithm.traversal Modifier and Type Class Description static class
BFS.Node<V>
This is a node in a BFS-spanning tree.static class
DFS.Node<V>
This is a node in a DFS-spanning tree.Methods in dev.nm.graph.algorithm.traversal that return types with arguments of type GraphTraversal.Node Modifier and Type Method Description List<? extends GraphTraversal.Node<V>>
BottomUp. getOrderedNodes()
List<? extends GraphTraversal.Node<V>>
BottomUp. getOrderedNodes(Collection<V> leaves)
Gets the list of visited nodes, in the order of being visited.List<? extends GraphTraversal.Node<V>>
GraphTraversal. getOrderedNodes()
Gets the list of visited nodes, in the order of being visited.List<? extends GraphTraversal.Node<V>>
TraversalFromRoots. getOrderedNodes()
Gets the collection of visited nodes to build a spanning tree.abstract List<? extends GraphTraversal.Node<V>>
TraversalFromRoots. track(V root, int time)
Runs the traversal algorithm on a graph from a designated root.Methods in dev.nm.graph.algorithm.traversal with parameters of type GraphTraversal.Node Modifier and Type Method Description int
GraphTraversal.Node. compareTo(GraphTraversal.Node<V> n)
-