Package | Description |
---|---|
dev.nm.graph | |
dev.nm.graph.algorithm.traversal | |
dev.nm.graph.type |
Modifier and Type | Interface and Description |
---|---|
static interface |
GraphUtils.EdgeFactory<V,N,E extends Edge<N>,X>
This interface specifies how an edge is created for two nodes.
|
Modifier and Type | Interface and Description |
---|---|
interface |
Arc<V>
An arc is an ordered pair of vertices.
|
interface |
UndirectedEdge<V>
A tagging interface for implementations of an undirected graph
that accept only undirected edges.
|
interface |
WeightedArc<V>
A weighted arc is an arc that has a weight or a cost associated with it.
|
Modifier and Type | Field and Description |
---|---|
protected Graph<? extends V,? extends Edge<V>> |
TraversalFromRoots.g |
Modifier and Type | Method and Description |
---|---|
static <V,W extends V> |
BFS.BFS(Graph<W,? extends Edge<V>> g,
V root,
int time)
Runs the breadth-first-search on a graph from a designated root.
|
static <V,W extends V> |
DFS.DFS(Graph<W,? extends Edge<V>> g,
V root,
int time)
Runs the depth-first-search on a graph from a designated root.
|
Constructor and Description |
---|
BFS(Graph<V,? extends Edge<V>> g)
Constructs a BFS tree of a graph.
|
DFS(Graph<? extends V,? extends Edge<V>> g)
Constructs a DFS tree of a graph.
|
TraversalFromRoots(Graph<? extends V,? extends Edge<V>> g)
Constructs a traversal order of a graph.
|
Modifier and Type | Class and Description |
---|---|
class |
SimpleArc<V>
A simple arc has two vertices: head and tail.
|
class |
SimpleEdge<V>
A simple edge has two vertices.
|
Copyright © 2010-2020 NM FinTech Ltd.. All Rights Reserved.