Uses of Interface
dev.nm.graph.DAGraph
-
Packages that use DAGraph Package Description dev.nm.graph dev.nm.graph.algorithm.traversal dev.nm.graph.type -
-
Uses of DAGraph in dev.nm.graph
Subinterfaces of DAGraph in dev.nm.graph Modifier and Type Interface 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.Methods in dev.nm.graph that return DAGraph Modifier and Type Method 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>>
DAGraph<N,E>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. -
Uses of DAGraph in dev.nm.graph.algorithm.traversal
Constructors in dev.nm.graph.algorithm.traversal with parameters of type DAGraph Constructor Description BottomUp(DAGraph<V,? extends Arc<V>> g)
Constructs a BottomUp traversal instance. -
Uses of DAGraph in dev.nm.graph.type
Classes in dev.nm.graph.type that implement DAGraph Modifier and Type Class 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>
AVertexTree
is both a tree and a vertex/node.This implementation builds a tree incrementally and recursively (combining trees).Constructors in dev.nm.graph.type with parameters of type DAGraph Constructor Description SparseDAGraph(DAGraph<V,E> g)
(Copy) construct a directed acyclic graph from another directed acyclic graph.
-