| Package | Description |
|---|---|
| dev.nm.graph | |
| dev.nm.graph.type |
| Modifier and Type | Interface and Description |
|---|---|
interface |
Forest<V,E extends HyperEdge<V>>
A forest is a disjoint union of trees.
|
interface |
RootedTree<V,E extends Arc<V>>
A rooted tree is a directed graph, and has a root to measure distance from the
root.
|
| Modifier and Type | Method and Description |
|---|---|
Set<Tree<V,E>> |
Forest.trees()
Get the disjoint set of trees.
|
| Modifier and Type | Class and Description |
|---|---|
class |
SparseTree<V>
This class implements the sparse tree representation.
|
class |
VertexTree<T>
A
VertexTree is both a tree and a vertex/node.This implementation builds a tree
incrementally and recursively (combining trees). |
Copyright © 2010-2020 NM FinTech Ltd.. All Rights Reserved.