Nested and Inner Type Summary

Modifier and Type	Class and Description
private abstract static class	DirectedGraphConnections.NodeConnection<N> A value class representing single connection between the origin node and another node.
private static class	DirectedGraphConnections.PredAndSucc A wrapper class to indicate a node is both a predecessor and successor while still providing the successor value.

Field Summary

Modifier and Type	Field and Description
private final Map<N, Object>	adjacentNodeValues
private final List<DirectedGraphConnections.NodeConnection<N>>	orderedNodeConnections All node connections in this graph, in edge insertion order.
private static final Object	PRED
private int	predecessorCount
private int	successorCount

Constructor Summary

Access	Constructor and Description
private	DirectedGraphConnections(Map<N, Object> adjacentNodeValues, List<DirectedGraphConnections.NodeConnection<N>> orderedNodeConnections, int predecessorCount, int successorCount)

Method Summary

Modifier and Type	Method and Description
public void	addPredecessor(N node, V unused) Implements com.google.common.graph.GraphConnections.addPredecessor. Add `node` as a predecessor to the origin node.
public V	addSuccessor(N node, V value) Implements com.google.common.graph.GraphConnections.addSuccessor. Add `node` as a successor to the origin node.
public Set<N>	adjacentNodes() Implements com.google.common.graph.GraphConnections.adjacentNodes.
public Iterator<EndpointPair<N>>	incidentEdgeIterator(N The node that this all of the connections in this class are connected to. thisNode) Implements com.google.common.graph.GraphConnections.incidentEdgeIterator. Returns an iterator over the incident edges.
private static boolean	isPredecessor(Object value)
private static boolean	isSuccessor(Object value)
pack-priv static <N, V> DirectedGraphConnections<N, V>	of(ElementOrder<N> incidentEdgeOrder)
pack-priv static <N, V> DirectedGraphConnections<N, V>	ofImmutable(N thisNode, Iterable<EndpointPair<N>> incidentEdges, Function<N, V> successorNodeToValueFn)
public Set<N>	predecessors() Implements com.google.common.graph.GraphConnections.predecessors.
public void	removePredecessor(N node) Implements com.google.common.graph.GraphConnections.removePredecessor. Remove `node` from the set of predecessors.
public V	removeSuccessor(Object node) Implements com.google.common.graph.GraphConnections.removeSuccessor. Remove `node` from the set of successors.
public Set<N>	successors() Implements com.google.common.graph.GraphConnections.successors.
public V	value(N node) Implements com.google.common.graph.GraphConnections.value. Returns the value associated with the edge connecting the origin node to `node`, or null if there is no such edge.

Inherited from java.lang.Object:: clone equals finalize getClass hashCode notify notifyAll toString wait wait wait

Field Detail

adjacentNodeValues	back to summary
private final Map<N, Object> adjacentNodeValues

orderedNodeConnections back to summary

orderedNodeConnections	back to summary
private final List<DirectedGraphConnections.NodeConnection<N>> orderedNodeConnections All node connections in this graph, in edge insertion order. Note This field and `adjacentNodeValues` cannot be combined into a single LinkedHashMap because one target node may be mapped to both a predecessor and a successor. A LinkedHashMap combines two such edges into a single node-value pair, even though the edges may not have been inserted consecutively. Annotations @CheckForNull

private final List<DirectedGraphConnections.NodeConnection<N>> orderedNodeConnections

All node connections in this graph, in edge insertion order.

Note

This field and adjacentNodeValues cannot be combined into a single LinkedHashMap because one target node may be mapped to both a predecessor and a successor. A LinkedHashMap combines two such edges into a single node-value pair, even though the edges may not have been inserted consecutively.

Annotations

@CheckForNull

PRED	back to summary
private static final Object PRED

predecessorCount	back to summary
private int predecessorCount

successorCount	back to summary
private int successorCount

Constructor Detail

DirectedGraphConnections	back to summary
private DirectedGraphConnections(Map<N, Object> adjacentNodeValues, List<DirectedGraphConnections.NodeConnection<N>> orderedNodeConnections, int predecessorCount, int successorCount)

Method Detail

addPredecessor back to summary

addPredecessor	back to summary
public void addPredecessor(N node, V unused) Implements com.google.common.graph.GraphConnections.addPredecessor. Doc from com.google.common.graph.GraphConnections.addPredecessor. 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. Annotations @Override

public void addPredecessor(N node, V unused)

Implements com.google.common.graph.GraphConnections.addPredecessor.

Doc from com.google.common.graph.GraphConnections.addPredecessor.

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.

Annotations

@Override

addSuccessor back to summary

addSuccessor	back to summary
public V addSuccessor(N node, V value) Implements com.google.common.graph.GraphConnections.addSuccessor. Doc from com.google.common.graph.GraphConnections.addSuccessor. 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. Annotations @SuppressWarnings:unchecked @Override @CheckForNull

public V addSuccessor(N node, V value)

Implements com.google.common.graph.GraphConnections.addSuccessor.

Doc from com.google.common.graph.GraphConnections.addSuccessor.

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.

Annotations

@SuppressWarnings:unchecked
@Override
@CheckForNull

adjacentNodes	back to summary
public Set<N> adjacentNodes() Implements com.google.common.graph.GraphConnections.adjacentNodes. Annotations @Override

adjacentNodes

back to summary

public Set<N> adjacentNodes()

Implements com.google.common.graph.GraphConnections.adjacentNodes.

Annotations

@Override

incidentEdgeIterator	back to summary
public Iterator<EndpointPair<N>> incidentEdgeIterator(N thisNode) Implements com.google.common.graph.GraphConnections.incidentEdgeIterator. Doc from com.google.common.graph.GraphConnections.incidentEdgeIterator. Returns an iterator over the incident edges. Parameters thisNode:N The node that this all of the connections in this class are connected to. Annotations @Override

incidentEdgeIterator

back to summary

public Iterator<EndpointPair<N>> incidentEdgeIterator(N thisNode)

Implements com.google.common.graph.GraphConnections.incidentEdgeIterator.

Doc from com.google.common.graph.GraphConnections.incidentEdgeIterator.

Returns an iterator over the incident edges.

Parameters

thisNode:N: The node that this all of the connections in this class are connected to.

Annotations

@Override

isPredecessor	back to summary
private static boolean isPredecessor(Object value)

isSuccessor	back to summary
private static boolean isSuccessor(Object value)

of	back to summary
pack-priv static <N, V> DirectedGraphConnections<N, V> of(ElementOrder<N> incidentEdgeOrder)

ofImmutable	back to summary
pack-priv static <N, V> DirectedGraphConnections<N, V> ofImmutable(N thisNode, Iterable<EndpointPair<N>> incidentEdges, Function<N, V> successorNodeToValueFn)

predecessors	back to summary
public Set<N> predecessors() Implements com.google.common.graph.GraphConnections.predecessors. Annotations @Override

predecessors

back to summary

public Set<N> predecessors()

Implements com.google.common.graph.GraphConnections.predecessors.

Annotations

@Override

removePredecessor back to summary

removePredecessor	back to summary
public void removePredecessor(N node) Implements com.google.common.graph.GraphConnections.removePredecessor. Doc from com.google.common.graph.GraphConnections.removePredecessor. Remove `node` from the set of predecessors. Annotations @SuppressWarnings:unchecked @Override

public void removePredecessor(N node)

Implements com.google.common.graph.GraphConnections.removePredecessor.

Doc from com.google.common.graph.GraphConnections.removePredecessor.

Remove node from the set of predecessors.

Annotations

@SuppressWarnings:unchecked
@Override

removeSuccessor back to summary

removeSuccessor	back to summary
public V removeSuccessor(Object node) Implements com.google.common.graph.GraphConnections.removeSuccessor. Doc from com.google.common.graph.GraphConnections.removeSuccessor. Remove `node` from the set of successors. Returns the value previously associated with the edge connecting the two nodes. Annotations @SuppressWarnings:unchecked @Override @CheckForNull

public V removeSuccessor(Object node)

Implements com.google.common.graph.GraphConnections.removeSuccessor.

Doc from com.google.common.graph.GraphConnections.removeSuccessor.

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

Annotations

@SuppressWarnings:unchecked
@Override
@CheckForNull

successors	back to summary
public Set<N> successors() Implements com.google.common.graph.GraphConnections.successors. Annotations @Override

successors

back to summary

public Set<N> successors()

Implements com.google.common.graph.GraphConnections.successors.

Annotations

@Override

value back to summary

value	back to summary
public V value(N node) Implements com.google.common.graph.GraphConnections.value. Doc from com.google.common.graph.GraphConnections.value. Returns the value associated with the edge connecting the origin node to `node`, or null if there is no such edge. Annotations @SuppressWarnings:unchecked @Override @CheckForNull

public V value(N node)

Implements com.google.common.graph.GraphConnections.value.

Doc from com.google.common.graph.GraphConnections.value.

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

Annotations

@SuppressWarnings:unchecked
@Override
@CheckForNull

com.google.common.graph back to summary

private abstract Class DirectedGraphConnections.NodeConnection<N>

Class Inheritance

extends Object

java.lang.Object
com.google.common.graph.DirectedGraphConnections.NodeConnection

Known Direct Subclasses

com.google.common.graph.DirectedGraphConnections.NodeConnection.Pred, com.google.common.graph.DirectedGraphConnections.NodeConnection.Succ

A value class representing single connection between the origin node and another node.

There can be two types of connections (predecessor and successor), which is represented by the two implementations.

Nested and Inner Type Summary

Modifier and Type	Class and Description
pack-priv static class	DirectedGraphConnections.NodeConnection.Pred<N>
pack-priv static class	DirectedGraphConnections.NodeConnection.Succ<N>

Field Summary

Modifier and Type	Field and Description
pack-priv final N	node

Constructor Summary

Access	Constructor and Description
pack-priv	NodeConnection(N node)

Method Summary

Inherited from java.lang.Object:: clone equals finalize getClass hashCode notify notifyAll toString wait wait wait

Field Detail

node	back to summary
pack-priv final N node

Constructor Detail

NodeConnection	back to summary
pack-priv NodeConnection(N node)

com.google.common.graph back to summary

pack-priv final Class DirectedGraphConnections.NodeConnection.Pred<N>

Class Inheritance

extends DirectedGraphConnections.NodeConnection<N>

java.lang.Object
com.google.common.graph.DirectedGraphConnections.NodeConnection
com.google.common.graph.DirectedGraphConnections.NodeConnection.Pred

Field Summary

Inherited from com.google.common.graph.DirectedGraphConnections.NodeConnection:: node

Constructor Summary

Access	Constructor and Description
pack-priv	Pred(N node)

Method Summary

Modifier and Type	Method and Description
public boolean	equals(Object the reference object with which to compare. that) Overrides java.lang.Object.equals. Indicates whether some other object is "equal to" this one.
public int	hashCode() Overrides java.lang.Object.hashCode. Returns a hash code value for the object.

Constructor Detail

Pred	back to summary
pack-priv Pred(N node)

Method Detail

equals back to summary

equals	back to summary
public boolean equals(Object that) Overrides java.lang.Object.equals. Doc from java.lang.Object.equals. Indicates whether some other object is "equal to" this one. The `equals` method implements an equivalence relation on non-null object references: It is reflexive: for any non-null reference value `x`, `x.equals(x)` should return `true`. It is symmetric: for any non-null reference values `x` and `y`, `x.equals(y)` should return `true` if and only if `y.equals(x)` returns `true`. It is transitive: for any non-null reference values `x`, `y`, and `z`, if `x.equals(y)` returns `true` and `y.equals(z)` returns `true`, then `x.equals(z)` should return `true`. It is consistent: for any non-null reference values `x` and `y`, multiple invocations of `x.equals(y)` consistently return `true` or consistently return `false`, provided no information used in `equals` comparisons on the objects is modified. For any non-null reference value `x`, `x.equals(null)` should return `false`. An equivalence relation partitions the elements it operates on into equivalence classes; all the members of an equivalence class are equal to each other. Members of an equivalence class are substitutable for each other, at least for some purposes. Parameters that:Object the reference object with which to compare. Returns:boolean `true` if this object is the same as the obj argument; `false` otherwise. Annotations @Override

public boolean equals(Object that)

Overrides java.lang.Object.equals.

Doc from java.lang.Object.equals.

Indicates whether some other object is "equal to" this one.

The equals method implements an equivalence relation on non-null object references:

It is reflexive: for any non-null reference value x, x.equals(x) should return true.
It is symmetric: for any non-null reference values x and y, x.equals(y) should return true if and only if y.equals(x) returns true.
It is transitive: for any non-null reference values x, y, and z, if x.equals(y) returns true and y.equals(z) returns true, then x.equals(z) should return true.
It is consistent: for any non-null reference values x and y, multiple invocations of x.equals(y) consistently return true or consistently return false, provided no information used in equals comparisons on the objects is modified.
For any non-null reference value x, x.equals(null) should return false.

An equivalence relation partitions the elements it operates on into equivalence classes; all the members of an equivalence class are equal to each other. Members of an equivalence class are substitutable for each other, at least for some purposes.

Parameters

that:Object: the reference object with which to compare.

Returns:boolean

true if this object is the same as the obj argument; false otherwise.

Annotations

@Override

hashCode back to summary

hashCode	back to summary
public int hashCode() Overrides java.lang.Object.hashCode. Doc from java.lang.Object.hashCode. Returns a hash code value for the object. This method is supported for the benefit of hash tables such as those provided by `java.util.HashMap`. The general contract of `hashCode` is: Whenever it is invoked on the same object more than once during an execution of a Java application, the `hashCode` method must consistently return the same integer, provided no information used in `equals` comparisons on the object is modified. This integer need not remain consistent from one execution of an application to another execution of the same application. If two objects are equal according to the `equals` method, then calling the `hashCode` method on each of the two objects must produce the same integer result. It is not required that if two objects are unequal according to the `equals` method, then calling the `hashCode` method on each of the two objects must produce distinct integer results. However, the programmer should be aware that producing distinct integer results for unequal objects may improve the performance of hash tables. Returns:int a hash code value for this object. Annotations @Override

public int hashCode()

Overrides java.lang.Object.hashCode.

Doc from java.lang.Object.hashCode.

Returns a hash code value for the object. This method is supported for the benefit of hash tables such as those provided by java.util.HashMap.

The general contract of hashCode is:

Whenever it is invoked on the same object more than once during an execution of a Java application, the hashCode method must consistently return the same integer, provided no information used in equals comparisons on the object is modified. This integer need not remain consistent from one execution of an application to another execution of the same application.
If two objects are equal according to the equals method, then calling the hashCode method on each of the two objects must produce the same integer result.
It is not required that if two objects are unequal according to the equals method, then calling the hashCode method on each of the two objects must produce distinct integer results. However, the programmer should be aware that producing distinct integer results for unequal objects may improve the performance of hash tables.

Returns:int

a hash code value for this object.

Annotations

@Override

com.google.common.graph back to summary

pack-priv final Class DirectedGraphConnections.NodeConnection.Succ<N>

Class Inheritance

extends DirectedGraphConnections.NodeConnection<N>

java.lang.Object
com.google.common.graph.DirectedGraphConnections.NodeConnection
com.google.common.graph.DirectedGraphConnections.NodeConnection.Succ

Field Summary

Inherited from com.google.common.graph.DirectedGraphConnections.NodeConnection:: node

Constructor Summary

Access	Constructor and Description
pack-priv	Succ(N node)

Method Summary

Modifier and Type	Method and Description
public boolean	equals(Object the reference object with which to compare. that) Overrides java.lang.Object.equals. Indicates whether some other object is "equal to" this one.
public int	hashCode() Overrides java.lang.Object.hashCode. Returns a hash code value for the object.

Constructor Detail

Succ	back to summary
pack-priv Succ(N node)

Method Detail

equals back to summary

equals	back to summary
public boolean equals(Object that) Overrides java.lang.Object.equals. Doc from java.lang.Object.equals. Indicates whether some other object is "equal to" this one. The `equals` method implements an equivalence relation on non-null object references: It is reflexive: for any non-null reference value `x`, `x.equals(x)` should return `true`. It is symmetric: for any non-null reference values `x` and `y`, `x.equals(y)` should return `true` if and only if `y.equals(x)` returns `true`. It is transitive: for any non-null reference values `x`, `y`, and `z`, if `x.equals(y)` returns `true` and `y.equals(z)` returns `true`, then `x.equals(z)` should return `true`. It is consistent: for any non-null reference values `x` and `y`, multiple invocations of `x.equals(y)` consistently return `true` or consistently return `false`, provided no information used in `equals` comparisons on the objects is modified. For any non-null reference value `x`, `x.equals(null)` should return `false`. An equivalence relation partitions the elements it operates on into equivalence classes; all the members of an equivalence class are equal to each other. Members of an equivalence class are substitutable for each other, at least for some purposes. Parameters that:Object the reference object with which to compare. Returns:boolean `true` if this object is the same as the obj argument; `false` otherwise. Annotations @Override

public boolean equals(Object that)

Overrides java.lang.Object.equals.

Doc from java.lang.Object.equals.

Indicates whether some other object is "equal to" this one.

The equals method implements an equivalence relation on non-null object references:

It is reflexive: for any non-null reference value x, x.equals(x) should return true.
It is symmetric: for any non-null reference values x and y, x.equals(y) should return true if and only if y.equals(x) returns true.
It is transitive: for any non-null reference values x, y, and z, if x.equals(y) returns true and y.equals(z) returns true, then x.equals(z) should return true.
It is consistent: for any non-null reference values x and y, multiple invocations of x.equals(y) consistently return true or consistently return false, provided no information used in equals comparisons on the objects is modified.
For any non-null reference value x, x.equals(null) should return false.

Parameters

that:Object: the reference object with which to compare.

Returns:boolean

true if this object is the same as the obj argument; false otherwise.

Annotations

@Override

hashCode back to summary

hashCode	back to summary
public int hashCode() Overrides java.lang.Object.hashCode. Doc from java.lang.Object.hashCode. Returns a hash code value for the object. This method is supported for the benefit of hash tables such as those provided by `java.util.HashMap`. The general contract of `hashCode` is: Whenever it is invoked on the same object more than once during an execution of a Java application, the `hashCode` method must consistently return the same integer, provided no information used in `equals` comparisons on the object is modified. This integer need not remain consistent from one execution of an application to another execution of the same application. If two objects are equal according to the `equals` method, then calling the `hashCode` method on each of the two objects must produce the same integer result. It is not required that if two objects are unequal according to the `equals` method, then calling the `hashCode` method on each of the two objects must produce distinct integer results. However, the programmer should be aware that producing distinct integer results for unequal objects may improve the performance of hash tables. Returns:int a hash code value for this object. Annotations @Override

public int hashCode()

Overrides java.lang.Object.hashCode.

Doc from java.lang.Object.hashCode.

Returns a hash code value for the object. This method is supported for the benefit of hash tables such as those provided by java.util.HashMap.

The general contract of hashCode is:

Whenever it is invoked on the same object more than once during an execution of a Java application, the hashCode method must consistently return the same integer, provided no information used in equals comparisons on the object is modified. This integer need not remain consistent from one execution of an application to another execution of the same application.
If two objects are equal according to the equals method, then calling the hashCode method on each of the two objects must produce the same integer result.
It is not required that if two objects are unequal according to the equals method, then calling the hashCode method on each of the two objects must produce distinct integer results. However, the programmer should be aware that producing distinct integer results for unequal objects may improve the performance of hash tables.

Returns:int

a hash code value for this object.

Annotations

@Override

com.google.common.graph back to summary

private final Class DirectedGraphConnections.PredAndSucc

Class Inheritance

extends Object

java.lang.Object
com.google.common.graph.DirectedGraphConnections.PredAndSucc

A wrapper class to indicate a node is both a predecessor and successor while still providing the successor value.

Field Summary

Modifier and Type	Field and Description
private final Object	successorValue

Constructor Summary

Access	Constructor and Description
pack-priv	PredAndSucc(Object successorValue)

Method Summary

Inherited from java.lang.Object:: clone equals finalize getClass hashCode notify notifyAll toString wait wait wait

Field Detail

successorValue	back to summary
private final Object successorValue

Constructor Detail

PredAndSucc	back to summary
pack-priv PredAndSucc(Object successorValue)

pack-priv final Class DirectedGraphConnections<N, V>

Nested and Inner Type Summary

Field Summary

Constructor Summary

Method Summary

Field Detail

Constructor Detail

Method Detail

private abstract Class DirectedGraphConnections.NodeConnection<N>

Nested and Inner Type Summary

Field Summary

Constructor Summary

Method Summary

Field Detail

Constructor Detail

pack-priv final Class DirectedGraphConnections.NodeConnection.Pred<N>

Field Summary

Constructor Summary

Method Summary

Constructor Detail

Method Detail

pack-priv final Class DirectedGraphConnections.NodeConnection.Succ<N>

Field Summary

Constructor Summary

Method Summary

Constructor Detail

Method Detail

private final Class DirectedGraphConnections.PredAndSucc

Field Summary

Constructor Summary

Method Summary

Field Detail

Constructor Detail