Interface | Description |
---|---|
GraphTraversal<V> |
A spanning tree T of a connected, undirected graph G is a tree composed of all the
vertices and some (or perhaps all) of the edges of G.
|
Class | Description |
---|---|
BFS<V> |
This class implements the breadth-first-search using iteration.
|
BFS.Node<V> |
This is a node in a BFS-spanning tree.
|
BottomUp<V> |
This implementation traverses a directed acyclic graph starting from the leaves at the bottom,
and reaches the roots.
|
DFS<V> |
This class implements the depth-first-search using iteration.
|
DFS.Node<V> |
This is a node in a DFS-spanning tree.
|
GraphTraversal.Node<V> |
This is a node in a spanning tree.
|
TraversalFromRoots<V> |
A graph traversal is the problem of visiting all the nodes in a graph in a particular manner.
|
Enum | Description |
---|---|
DFS.Node.Color |
This is the coloring scheme of visits.
|
Copyright © 2010-2020 NM FinTech Ltd.. All Rights Reserved.