Package | Description |
---|---|
dev.nm.graph.algorithm.traversal |
Modifier and Type | Class and 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.
|
Modifier and Type | Method and Description |
---|---|
List<? extends GraphTraversal.Node<V>> |
BottomUp.getOrderedNodes() |
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.
|
List<? extends GraphTraversal.Node<V>> |
BottomUp.getOrderedNodes(Collection<V> leaves)
Gets the list of visited nodes, in the order of being visited.
|
abstract List<? extends GraphTraversal.Node<V>> |
TraversalFromRoots.track(V root,
int time)
Runs the traversal algorithm on a graph from a designated root.
|
Modifier and Type | Method and Description |
---|---|
int |
GraphTraversal.Node.compareTo(GraphTraversal.Node<V> n) |
Copyright © 2010-2020 NM FinTech Ltd.. All Rights Reserved.