N
- Value type that the graph node stores.E
- Value type that the graph edge stores.public abstract class UndiGraph<N,E> extends Graph<N,E>
Modifier and Type | Class and Description |
---|---|
static interface |
UndiGraph.UndiGraphEdge<N,E>
A generic undirected graph edge.
|
static interface |
UndiGraph.UndiGraphNode<N,E>
A generic undirected graph node.
|
Graph.GraphEdge<N,E>, Graph.SimpleSubGraph<N,E>
Constructor and Description |
---|
UndiGraph() |
Modifier and Type | Method and Description |
---|---|
(package private) abstract UndiGraph.UndiGraphNode<N,E> |
createUndirectedGraphNode(N nodeValue) |
(package private) abstract java.util.List<UndiGraph.UndiGraphEdge<N,E>> |
getUndirectedGraphEdges(N n1,
N n2) |
abstract UndiGraph.UndiGraphNode<N,E> |
getUndirectedGraphNode(N nodeValue) |
(package private) abstract java.util.Collection<UndiGraph.UndiGraphNode<N,E>> |
getUndirectedGraphNodes()
Gets an immutable collection of all the nodes in this graph.
|
clearEdgeAnnotations, clearNodeAnnotations, connect, connectIfNotFound, createNode, disconnect, getEdges, getEdges, getFirstEdge, getNeighborNodes, getNodeDegree, getNodeOrFail, getNodes, getWeight, hasNode, isConnected, isConnected, popEdgeAnnotations, popNodeAnnotations, pushEdgeAnnotations, pushNodeAnnotations
clone, equals, finalize, getClass, hashCode, notify, notifyAll, toString, wait, wait, wait
getNode, newSubGraph
abstract java.util.Collection<UndiGraph.UndiGraphNode<N,E>> getUndirectedGraphNodes()
abstract UndiGraph.UndiGraphNode<N,E> createUndirectedGraphNode(N nodeValue)
public abstract UndiGraph.UndiGraphNode<N,E> getUndirectedGraphNode(N nodeValue)
abstract java.util.List<UndiGraph.UndiGraphEdge<N,E>> getUndirectedGraphEdges(N n1, N n2)