pack-priv abstract Class ForwardingGraph<N>

Implements com.google.common.graph.Graph.adjacentNodes, com.google.common.graph.BaseGraph.adjacentNodes.

Doc from com.google.common.graph.Graph.adjacentNodes.

Returns the nodes which have an incident edge in common with node in this graph.

This is equal to the union of predecessors(Object) and successors(Object).

Annotations

@Override

Implements com.google.common.graph.Graph.allowsSelfLoops, com.google.common.graph.BaseGraph.allowsSelfLoops.

Doc from com.google.common.graph.Graph.allowsSelfLoops.

Returns true if this graph allows self-loops (edges that connect a node to itself). Attempting to add a self-loop to a graph that does not allow them will throw an IllegalArgumentException.

Annotations

@Override

Overrides com.google.common.graph.AbstractBaseGraph.degree.

Implements com.google.common.graph.Graph.degree, com.google.common.graph.BaseGraph.degree.

Doc from com.google.common.graph.Graph.degree.

Returns the count of node's incident edges, counting self-loops twice (equivalently, the number of times an edge touches node).

For directed graphs, this is equal to inDegree(node) + outDegree(node).

For undirected graphs, this is equal to incidentEdges(node).size() + (number of self-loops incident to node).

If the count is greater than Integer.MAX_VALUE, returns Integer.MAX_VALUE.

Annotations

@Override

Overrides com.google.common.graph.AbstractBaseGraph.hasEdgeConnecting.

Implements com.google.common.graph.Graph.hasEdgeConnecting, com.google.common.graph.BaseGraph.hasEdgeConnecting.

Doc from com.google.common.graph.Graph.hasEdgeConnecting.

Returns true if there is an edge that directly connects nodeU to nodeV. This is equivalent to nodes().contains(nodeU) && successors(nodeU).contains(nodeV).

In an undirected graph, this is equal to hasEdgeConnecting(nodeV, nodeU).

Annotations

@Override

Overrides com.google.common.graph.AbstractBaseGraph.hasEdgeConnecting.

Implements com.google.common.graph.Graph.hasEdgeConnecting, com.google.common.graph.BaseGraph.hasEdgeConnecting.

Doc from com.google.common.graph.Graph.hasEdgeConnecting.

Returns true if there is an edge that directly connects endpoints (in the order, if any, specified by endpoints). This is equivalent to edges().contains(endpoints).

Unlike the other EndpointPair-accepting methods, this method does not throw if the endpoints are unordered and the graph is directed; it simply returns false. This is for consistency with the behavior of Collection#contains(Object) (which does not generally throw if the object cannot be present in the collection), and the desire to have this method's behavior be compatible with edges().contains(endpoints).

Annotations

@Override

Overrides com.google.common.graph.AbstractBaseGraph.incidentEdgeOrder.

Implements com.google.common.graph.Graph.incidentEdgeOrder, com.google.common.graph.BaseGraph.incidentEdgeOrder.

Doc from com.google.common.graph.Graph.incidentEdgeOrder.

Returns an ElementOrder that specifies the order of iteration for the elements of edges(), adjacentNodes(Object), predecessors(Object), successors(Object) and incidentEdges(Object).

Annotations

@Override

Overrides com.google.common.graph.AbstractBaseGraph.incidentEdges.

Implements com.google.common.graph.Graph.incidentEdges, com.google.common.graph.BaseGraph.incidentEdges.

Doc from com.google.common.graph.Graph.incidentEdges.

Returns the edges in this graph whose endpoints include node.

This is equal to the union of incoming and outgoing edges.

Annotations

@Override

Overrides com.google.common.graph.AbstractBaseGraph.inDegree.

Implements com.google.common.graph.Graph.inDegree, com.google.common.graph.BaseGraph.inDegree.

Doc from com.google.common.graph.Graph.inDegree.

Returns the count of node's incoming edges (equal to predecessors(node).size()) in a directed graph. In an undirected graph, returns the degree(Object).

If the count is greater than Integer.MAX_VALUE, returns Integer.MAX_VALUE.

Annotations

@Override

Implements com.google.common.graph.Graph.isDirected, com.google.common.graph.BaseGraph.isDirected.

Doc from com.google.common.graph.Graph.isDirected.

Returns true if the edges in this graph are directed. Directed edges connect a source node to a target node, while undirected edges connect a pair of nodes to each other.

Annotations

@Override

Implements com.google.common.graph.Graph.nodeOrder, com.google.common.graph.BaseGraph.nodeOrder.

Doc from com.google.common.graph.Graph.nodeOrder.

Returns the order of iteration for the elements of nodes().

Annotations

@Override

Implements com.google.common.graph.Graph.nodes, com.google.common.graph.BaseGraph.nodes.

Doc from com.google.common.graph.Graph.nodes.

Returns all nodes in this graph, in the order specified by nodeOrder().

Annotations

@Override

Overrides com.google.common.graph.AbstractBaseGraph.outDegree.

Implements com.google.common.graph.Graph.outDegree, com.google.common.graph.BaseGraph.outDegree.

Doc from com.google.common.graph.Graph.outDegree.

Returns the count of node's outgoing edges (equal to successors(node).size()) in a directed graph. In an undirected graph, returns the degree(Object).

If the count is greater than Integer.MAX_VALUE, returns Integer.MAX_VALUE.

Annotations

@Override

Implements com.google.common.graph.Graph.predecessors, com.google.common.graph.BaseGraph.predecessors.

Doc from com.google.common.graph.Graph.predecessors.

Returns all nodes in this graph adjacent to node which can be reached by traversing node's incoming edges against the direction (if any) of the edge.

In an undirected graph, this is equivalent to adjacentNodes(Object).

Annotations

@Override

Implements com.google.common.graph.Graph.successors, com.google.common.graph.BaseGraph.successors.

Doc from com.google.common.graph.Graph.successors.

Returns all nodes in this graph adjacent to node which can be reached by traversing node's outgoing edges in the direction (if any) of the edge.

In an undirected graph, this is equivalent to adjacentNodes(Object).

This is not the same as "all nodes reachable from node by following outgoing edges". For that functionality, see Graphs#reachableNodes(Graph, Object).

Annotations

@Override