| Package | Description |
|---|---|
| dev.nm.graph.algorithm.traversal |
| Class and Description |
|---|
| BFS.Node
This is a node in a BFS-spanning tree.
|
| DFS.Node
This is a node in a DFS-spanning tree.
|
| DFS.Node.Color
This is the coloring scheme of visits.
|
| GraphTraversal
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.
|
| GraphTraversal.Node
This is a node in a spanning tree.
|
| TraversalFromRoots
A graph traversal is the problem of visiting all the nodes in a graph in a particular manner.
|
Copyright © 2010-2020 NM FinTech Ltd.. All Rights Reserved.