Search Java Classes and Packages
#Com.numericalmethod.suanshu.graph.algorithm.traversal Classes and Interfaces - 9 results found.
| Name | Description | Type | Package | Framework |
| BFS | This class implements the breadth-first-search using iteration. | Class | com.numericalmethod.suanshu.graph.algorithm.traversal | SuanShu |
| BFS .Node | This is a node in a BFS-spanning tree. | Class | com.numericalmethod.suanshu.graph.algorithm.traversal | SuanShu |
| BottomUp | This implementation traverses a directed acyclic graph starting from the leaves at the bottom, and reaches the roots. | Class | com.numericalmethod.suanshu.graph.algorithm.traversal | SuanShu |
| DFS | This class implements the depth-first-search using iteration. | Class | com.numericalmethod.suanshu.graph.algorithm.traversal | SuanShu |
| DFS .Node | This is a node in a DFS-spanning tree. | Class | com.numericalmethod.suanshu.graph.algorithm.traversal | SuanShu |
| DFS .Node .Color | This is the coloring scheme of visits. | Class | com.numericalmethod.suanshu.graph.algorithm.traversal | SuanShu |
| 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. | Interface | com.numericalmethod.suanshu.graph.algorithm.traversal | SuanShu |
| GraphTraversal .Node | This is a node in a spanning tree. | Class | com.numericalmethod.suanshu.graph.algorithm.traversal | SuanShu |
| TraversalFromRoots | A graph traversal is the problem of visiting all the nodes in a graph in a particular manner. | Class | com.numericalmethod.suanshu.graph.algorithm.traversal | SuanShu |