Package | Description |
---|---|
dev.nm.graph | |
dev.nm.graph.algorithm.shortestpath | |
dev.nm.graph.type |
Modifier and Type | Interface and 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.
|
Modifier and Type | Method and 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.
|
Constructor and Description |
---|
Dijkstra(DiGraph<V,? extends WeightedArc<V>> g,
V source) |
Modifier and Type | Class and 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>
A
VertexTree is both a tree and a vertex/node.This implementation builds a tree
incrementally and recursively (combining trees). |
Constructor and Description |
---|
SparseDiGraph(DiGraph<V,E> g)
(Copy) construct a graph from another graph.
|
Copyright © 2010-2020 NM FinTech Ltd.. All Rights Reserved.