Package | Description |
---|---|
dev.nm.graph | |
dev.nm.graph.algorithm.traversal | |
dev.nm.graph.type |
Modifier and Type | Interface and Description |
---|---|
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 |
---|---|
static <V> DAGraph<V,Arc<V>> |
GraphUtils.unDi2DAGraph(UnDiGraph<V,? extends UndirectedEdge<V>> g,
V root)
Converts an undirected graph into a directed acyclic graph, arcs are created from the edges
by
parent-child relations as determined by breadth-first-search.
|
static <V,N,E extends Arc<N>> |
GraphUtils.unDi2DAGraph(UnDiGraph<V,? extends UndirectedEdge<V>> g,
V root,
GraphUtils.EdgeFactory<V,N,E,UndirectedEdge<V>> edgeFactory)
Converts an undirected graph into a directed acyclic graph, arcs are created from the edges
by parent-child relations as determined by breadth-first-search.
|
Constructor and Description |
---|
BottomUp(DAGraph<V,? extends Arc<V>> g)
Constructs a BottomUp traversal instance.
|
Modifier and Type | Class and Description |
---|---|
class |
SparseDAGraph<V,E extends Arc<V>>
This class implements the sparse directed acyclic graph representation.
|
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). |
Constructor and Description |
---|
SparseDAGraph(DAGraph<V,E> g)
(Copy) construct a directed acyclic graph from another directed acyclic graph.
|
Copyright © 2010-2020 NM FinTech Ltd.. All Rights Reserved.