Uses of Interface
dev.nm.graph.DiGraph
-
Packages that use DiGraph Package Description dev.nm.graph dev.nm.graph.algorithm.shortestpath dev.nm.graph.type -
-
Uses of DiGraph in dev.nm.graph
Subinterfaces of DiGraph in dev.nm.graph Modifier and Type Interface Description interface
DAGraph<V,E extends Arc<V>>
A directed acyclic graph (DAG), is a directed graph with no directed cycles.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 with parameters of type DiGraph Modifier and Type Method Description static <V> UnDiGraph<V,UndirectedEdge<V>>
GraphUtils. di2UnDiGraph(DiGraph<V,? extends Arc<V>> diG)
Converts a directed graph into an undirected graph by removing the direction of all arcs.static <V> Set<V>
GraphUtils. getChildren(DiGraph<V,? extends Arc<V>> g, V v)
Get the set of vertices that have an incoming arc coming from a vertex.static <V> Set<V>
GraphUtils. getParents(DiGraph<V,? extends Arc<V>> g, V v)
Get the set of vertices that have an outgoing arc pointing to a vertex.static <V> boolean
GraphUtils. isStronglyConnected(DiGraph<V,? extends Arc<V>> g)
Check whether a directed graph is strongly connected.static <V> int
GraphUtils. numberOfChildren(DiGraph<V,? extends Arc<V>> g, V v)
Gets the number of children.static <V> int
GraphUtils. numberOfParents(DiGraph<V,? extends Arc<V>> g, V v)
Gets the number of parents. -
Uses of DiGraph in dev.nm.graph.algorithm.shortestpath
Constructors in dev.nm.graph.algorithm.shortestpath with parameters of type DiGraph Constructor Description Dijkstra(DiGraph<V,? extends WeightedArc<V>> g, V source)
-
Uses of DiGraph in dev.nm.graph.type
Classes in dev.nm.graph.type that implement DiGraph Modifier and Type Class Description class
SparseDAGraph<V,E extends Arc<V>>
This class implements the sparse directed acyclic graph representation.class
SparseDiGraph<V,E extends Arc<V>>
This class implements the sparse directed 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 DiGraph Constructor Description SparseDiGraph(DiGraph<V,E> g)
(Copy) construct a graph from another graph.
-