N - Value type that the graph node stores.E - Value type that the graph edge stores.public class LinkedUndirectedGraph<N,E> extends UndiGraph<N,E> implements GraphvizGraph
UndiGraph.UndiGraphEdge<N,E>, UndiGraph.UndiGraphNode<N,E>Graph.GraphEdge<N,E>GraphvizGraph.GraphvizEdge, GraphvizGraph.GraphvizNode| Modifier and Type | Field and Description |
|---|---|
protected Map<N,com.google.javascript.jscomp.graph.LinkedUndirectedGraph.LinkedUndirectedGraphNode<N,E>> |
nodes |
| Modifier | Constructor and Description |
|---|---|
protected |
LinkedUndirectedGraph(boolean useNodeAnnotations,
boolean useEdgeAnnotations) |
| Modifier and Type | Method and Description |
|---|---|
void |
connect(N srcValue,
E edgeValue,
N destValue)
Connects two nodes in the graph with an edge.
|
static <N,E> LinkedUndirectedGraph<N,E> |
create() |
GraphNode<N,E> |
createNode(N value)
Gets a node from the graph given a value.
|
UndiGraph.UndiGraphNode<N,E> |
createUndirectedGraphNode(N nodeValue) |
static <N,E> LinkedUndirectedGraph<N,E> |
createWithEdgeAnnotations() |
static <N,E> LinkedUndirectedGraph<N,E> |
createWithNodeAnnotations() |
static <N,E> LinkedUndirectedGraph<N,E> |
createWithoutAnnotations() |
void |
disconnect(N srcValue,
N destValue)
Disconnects two nodes in the graph by removing all edges between them.
|
List<Graph.GraphEdge<N,E>> |
getEdges()
Gets an immutable list of all edges.
|
List<Graph.GraphEdge<N,E>> |
getEdges(N n1,
N n2)
Retrieves an edge from the graph.
|
Graph.GraphEdge<N,E> |
getFirstEdge(N n1,
N n2)
Retrieves any edge from the graph.
|
List<GraphvizGraph.GraphvizEdge> |
getGraphvizEdges()
Retrieve a list of edges in the graph.
|
List<GraphvizGraph.GraphvizNode> |
getGraphvizNodes()
Retrieve a list of nodes in the graph.
|
String |
getName()
Name of the graph.
|
List<GraphNode<N,E>> |
getNeighborNodes(N value)
Gets the neighboring nodes.
|
Iterator<GraphNode<N,E>> |
getNeighborNodesIterator(N value) |
GraphNode<N,E> |
getNode(N value)
Gets a node from the graph given a value.
|
int |
getNodeDegree(N value)
Gets the degree of a node.
|
Collection<GraphNode<N,E>> |
getNodes()
Gets an immutable list of all nodes.
|
List<UndiGraph.UndiGraphEdge<N,E>> |
getUndirectedGraphEdges(N n1,
N n2) |
UndiGraph.UndiGraphNode<N,E> |
getUndirectedGraphNode(N nodeValue) |
Collection<UndiGraph.UndiGraphNode<N,E>> |
getUndirectedGraphNodes()
Gets an immutable collection of all the nodes in this graph.
|
boolean |
isConnected(N n1,
E e,
N n2)
Checks whether two nodes in the graph are connected by the given
edge type.
|
boolean |
isConnected(N n1,
N n2)
Checks whether two nodes in the graph are connected.
|
boolean |
isDirected()
Graph type.
|
SubGraph<N,E> |
newSubGraph()
Returns an empty SubGraph for this Graph.
|
clearEdgeAnnotations, clearNodeAnnotations, connectIfNotFound, getWeight, hasNode, popEdgeAnnotations, popNodeAnnotations, pushEdgeAnnotations, pushNodeAnnotationsprotected LinkedUndirectedGraph(boolean useNodeAnnotations,
boolean useEdgeAnnotations)
public SubGraph<N,E> newSubGraph()
AdjacencyGraphnewSubGraph in interface AdjacencyGraph<N,E>public static <N,E> LinkedUndirectedGraph<N,E> createWithoutAnnotations()
public static <N,E> LinkedUndirectedGraph<N,E> createWithNodeAnnotations()
public static <N,E> LinkedUndirectedGraph<N,E> createWithEdgeAnnotations()
public static <N,E> LinkedUndirectedGraph<N,E> create()
public void connect(N srcValue, E edgeValue, N destValue)
Graphpublic void disconnect(N srcValue, N destValue)
Graphdisconnect in class Graph<N,E>srcValue - First node.destValue - Second node.public UndiGraph.UndiGraphNode<N,E> createUndirectedGraphNode(N nodeValue)
public List<GraphNode<N,E>> getNeighborNodes(N value)
GraphgetNeighborNodes in class Graph<N,E>value - The node's value.public Iterator<GraphNode<N,E>> getNeighborNodesIterator(N value)
getNeighborNodesIterator in class Graph<N,E>public List<UndiGraph.UndiGraphEdge<N,E>> getUndirectedGraphEdges(N n1, N n2)
public UndiGraph.UndiGraphNode<N,E> getUndirectedGraphNode(N nodeValue)
getUndirectedGraphNode in class UndiGraph<N,E>public Collection<UndiGraph.UndiGraphNode<N,E>> getUndirectedGraphNodes()
UndiGraphpublic GraphNode<N,E> createNode(N value)
GraphObject.equals.createNode in class Graph<N,E>value - The node's value.public List<Graph.GraphEdge<N,E>> getEdges(N n1, N n2)
Graphpublic Graph.GraphEdge<N,E> getFirstEdge(N n1, N n2)
GraphgetFirstEdge in class Graph<N,E>n1 - Node one.n2 - Node two.public GraphNode<N,E> getNode(N value)
AdjacencyGraphObject.equals.getNode in interface AdjacencyGraph<N,E>value - The node's value.public boolean isConnected(N n1, N n2)
GraphisConnected in class Graph<N,E>n1 - Node 1.n2 - Node 2.true if the two nodes are connected.public boolean isConnected(N n1, E e, N n2)
GraphisConnected in class Graph<N,E>n1 - Node 1.e - The edge type.n2 - Node 2.public List<GraphvizGraph.GraphvizEdge> getGraphvizEdges()
GraphvizGraphgetGraphvizEdges in interface GraphvizGraphpublic String getName()
GraphvizGraphgetName in interface GraphvizGraphpublic List<GraphvizGraph.GraphvizNode> getGraphvizNodes()
GraphvizGraphgetGraphvizNodes in interface GraphvizGraphpublic boolean isDirected()
GraphvizGraphisDirected in interface GraphvizGraphpublic Collection<GraphNode<N,E>> getNodes()
Graphpublic List<Graph.GraphEdge<N,E>> getEdges()
Graph