Package | Description |
---|---|
dev.nm.graph | |
dev.nm.graph.type |
Modifier and Type | Interface and Description |
---|---|
interface |
Forest<V,E extends HyperEdge<V>>
A forest is a disjoint union of trees.
|
interface |
Graph<V,E extends HyperEdge<V>>
A graph is a representation of a set of objects where some pairs of the objects are connected by
links.
|
interface |
Tree<V,E extends HyperEdge<V>>
A tree is an undirected graph in which any two vertices are connected by exactly one simple path.
|
Modifier and Type | Interface and Description |
---|---|
interface |
Arc<V>
An arc is an ordered pair of vertices.
|
interface |
Edge<V>
An edge connects a 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.
|
interface |
WeightedEdge<V>
A weighted edge has a weight or a cost associated with it.
|
Modifier and Type | Method and Description |
---|---|
static <V,E extends HyperEdge<V>> |
GraphUtils.addEdges(Graph<V,E> g,
E... edges)
Add a set of edges to a graph.
|
static <V,E extends HyperEdge<V>> |
GraphUtils.removeIsolatedVertices(Graph<V,E> g)
Removes those nodes that have no edges from a graph.
|
Modifier and Type | Method and Description |
---|---|
static <V> Set<HyperEdge<V>> |
GraphUtils.getEdges(Graph<V,?> g,
V v1,
V v2)
Gets the set of edges that connect the two vertices.
|
Modifier and Type | Method and Description |
---|---|
static <V,E extends HyperEdge<V>> |
GraphUtils.addEdges(Graph<V,E> g,
E... edges)
Add a set of edges to a graph.
|
static <V> boolean |
GraphUtils.containsEdge(Graph<V,?> g,
HyperEdge<V> e)
Returns true if this graph's edge collection contains
e |
Modifier and Type | Class and Description |
---|---|
class |
SparseGraph<V,E extends HyperEdge<V>>
This class implements the sparse graph representation.
|
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.