Package com.google.common.graph

Class UndirectedGraphConnections<N,V>

java.lang.Object

com.google.common.graph.UndirectedGraphConnections<N,V>

Type Parameters:

N - Node parameter type

V - Value parameter type

All Implemented Interfaces:

GraphConnections<N,V>

final class UndirectedGraphConnections<N,V>
extends java.lang.Object
implements GraphConnections<N,V>

An implementation of GraphConnections for undirected graphs.

Field Summary

Fields

Modifier and Type	Field	Description
private java.util.Map<N,V>	adjacentNodeValues

Constructor Summary

Constructors

Modifier	Constructor	Description
private	UndirectedGraphConnections(java.util.Map<N,V> adjacentNodeValues)

Method Summary

Modifier and Type	Method	Description
void	addPredecessor(N node, V value)	Add node as a predecessor to the origin node.
V	addSuccessor(N node, V value)	Add node as a successor to the origin node.
java.util.Set<N>	adjacentNodes()
(package private) static <N,V> UndirectedGraphConnections<N,V>	of()
(package private) static <N,V> UndirectedGraphConnections<N,V>	ofImmutable(java.util.Map<N,V> adjacentNodeValues)
java.util.Set<N>	predecessors()
void	removePredecessor(N node)	Remove node from the set of predecessors.
V	removeSuccessor(N node)	Remove node from the set of successors.
java.util.Set<N>	successors()
V	value(N node)	Returns the value associated with the edge connecting the origin node to node, or null if there is no such edge.

Methods inherited from class java.lang.Object

clone, equals, finalize, getClass, hashCode, notify, notifyAll, toString, wait, wait, wait

Field Detail

adjacentNodeValues

private final java.util.Map<N,V> adjacentNodeValues

Constructor Detail

UndirectedGraphConnections

private UndirectedGraphConnections(java.util.Map<N,V> adjacentNodeValues)

Method Detail

of

static <N,V> UndirectedGraphConnections<N,V> of()

ofImmutable

static <N,V> UndirectedGraphConnections<N,V> ofImmutable(java.util.Map<N,V> adjacentNodeValues)

adjacentNodes

public java.util.Set<N> adjacentNodes()

Specified by:

adjacentNodes in interface GraphConnections<N,V>

predecessors

public java.util.Set<N> predecessors()

Specified by:

predecessors in interface GraphConnections<N,V>

successors

public java.util.Set<N> successors()

Specified by:

successors in interface GraphConnections<N,V>

value

public V value(N node)

Description copied from interface: GraphConnections

Returns the value associated with the edge connecting the origin node to node, or null if there is no such edge.

Specified by:

value in interface GraphConnections<N,V>

removePredecessor

public void removePredecessor(N node)

Description copied from interface: GraphConnections

Remove node from the set of predecessors.

Specified by:

removePredecessor in interface GraphConnections<N,V>

removeSuccessor

public V removeSuccessor(N node)

Description copied from interface: GraphConnections

Remove node from the set of successors. Returns the value previously associated with the edge connecting the two nodes.

Specified by:

removeSuccessor in interface GraphConnections<N,V>

addPredecessor

public void addPredecessor(N node,
                           V value)

Description copied from interface: GraphConnections

Add node as a predecessor to the origin node. In the case of an undirected graph, it also becomes a successor. Associates value with the edge connecting the two nodes.

Specified by:

addPredecessor in interface GraphConnections<N,V>

addSuccessor

public V addSuccessor(N node,
                      V value)

Description copied from interface: GraphConnections

Add node as a successor to the origin node. In the case of an undirected graph, it also becomes a predecessor. Associates value with the edge connecting the two nodes. Returns the value previously associated with the edge connecting the two nodes.

Specified by:

addSuccessor in interface GraphConnections<N,V>