Interface BaseGraph<N>
-
- Type Parameters:
N
- Node parameter type
- All Superinterfaces:
PredecessorsFunction<N>
,SuccessorsFunction<N>
- All Known Subinterfaces:
Graph<N>
,MutableGraph<N>
,MutableValueGraph<N,V>
,ValueGraph<N,V>
- All Known Implementing Classes:
AbstractBaseGraph
,AbstractGraph
,AbstractValueGraph
,ForwardingGraph
,ForwardingValueGraph
,Graphs.TransposedGraph
,Graphs.TransposedValueGraph
,ImmutableGraph
,ImmutableValueGraph
,StandardMutableGraph
,StandardMutableValueGraph
,StandardValueGraph
interface BaseGraph<N> extends SuccessorsFunction<N>, PredecessorsFunction<N>
A non-public interface for the methods shared betweenGraph
andValueGraph
.
-
-
Method Summary
All Methods Instance Methods Abstract Methods Modifier and Type Method Description java.util.Set<N>
adjacentNodes(N node)
Returns the nodes which have an incident edge in common withnode
in this graph.boolean
allowsSelfLoops()
Returns true if this graph allows self-loops (edges that connect a node to itself).int
degree(N node)
Returns the count ofnode
's incident edges, counting self-loops twice (equivalently, the number of times an edge touchesnode
).java.util.Set<EndpointPair<N>>
edges()
Returns all edges in this graph.boolean
hasEdgeConnecting(EndpointPair<N> endpoints)
Returns true if there is an edge that directly connectsendpoints
(in the order, if any, specified byendpoints
).boolean
hasEdgeConnecting(N nodeU, N nodeV)
Returns true if there is an edge that directly connectsnodeU
tonodeV
.ElementOrder<N>
incidentEdgeOrder()
Returns anElementOrder
that specifies the order of iteration for the elements ofedges()
,adjacentNodes(Object)
,predecessors(Object)
,successors(Object)
andincidentEdges(Object)
.java.util.Set<EndpointPair<N>>
incidentEdges(N node)
Returns the edges in this graph whose endpoints includenode
.int
inDegree(N node)
Returns the count ofnode
's incoming edges (equal topredecessors(node).size()
) in a directed graph.boolean
isDirected()
Returns true if the edges in this graph are directed.ElementOrder<N>
nodeOrder()
Returns the order of iteration for the elements ofnodes()
.java.util.Set<N>
nodes()
Returns all nodes in this graph, in the order specified bynodeOrder()
.int
outDegree(N node)
Returns the count ofnode
's outgoing edges (equal tosuccessors(node).size()
) in a directed graph.java.util.Set<N>
predecessors(N node)
Returns all nodes in this graph adjacent tonode
which can be reached by traversingnode
's incoming edges against the direction (if any) of the edge.java.util.Set<N>
successors(N node)
Returns all nodes in this graph adjacent tonode
which can be reached by traversingnode
's outgoing edges in the direction (if any) of the edge.
-
-
-
Method Detail
-
nodes
java.util.Set<N> nodes()
Returns all nodes in this graph, in the order specified bynodeOrder()
.
-
edges
java.util.Set<EndpointPair<N>> edges()
Returns all edges in this graph.
-
isDirected
boolean isDirected()
Returns true if the edges in this graph are directed. Directed edges connect asource node
to atarget node
, while undirected edges connect a pair of nodes to each other.
-
allowsSelfLoops
boolean 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 anIllegalArgumentException
.
-
nodeOrder
ElementOrder<N> nodeOrder()
Returns the order of iteration for the elements ofnodes()
.
-
incidentEdgeOrder
ElementOrder<N> incidentEdgeOrder()
Returns anElementOrder
that specifies the order of iteration for the elements ofedges()
,adjacentNodes(Object)
,predecessors(Object)
,successors(Object)
andincidentEdges(Object)
.- Since:
- 29.0
-
adjacentNodes
java.util.Set<N> adjacentNodes(N node)
Returns the nodes which have an incident edge in common withnode
in this graph.This is equal to the union of
predecessors(Object)
andsuccessors(Object)
.- Throws:
java.lang.IllegalArgumentException
- ifnode
is not an element of this graph
-
predecessors
java.util.Set<N> predecessors(N node)
Returns all nodes in this graph adjacent tonode
which can be reached by traversingnode
's incoming edges against the direction (if any) of the edge.In an undirected graph, this is equivalent to
adjacentNodes(Object)
.- Specified by:
predecessors
in interfacePredecessorsFunction<N>
- Throws:
java.lang.IllegalArgumentException
- ifnode
is not an element of this graph
-
successors
java.util.Set<N> successors(N node)
Returns all nodes in this graph adjacent tonode
which can be reached by traversingnode
'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, seeGraphs.reachableNodes(Graph, Object)
.- Specified by:
successors
in interfaceSuccessorsFunction<N>
- Throws:
java.lang.IllegalArgumentException
- ifnode
is not an element of this graph
-
incidentEdges
java.util.Set<EndpointPair<N>> incidentEdges(N node)
Returns the edges in this graph whose endpoints includenode
.This is equal to the union of incoming and outgoing edges.
- Throws:
java.lang.IllegalArgumentException
- ifnode
is not an element of this graph- Since:
- 24.0
-
degree
int degree(N node)
Returns the count ofnode
's incident edges, counting self-loops twice (equivalently, the number of times an edge touchesnode
).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 tonode
).If the count is greater than
Integer.MAX_VALUE
, returnsInteger.MAX_VALUE
.- Throws:
java.lang.IllegalArgumentException
- ifnode
is not an element of this graph
-
inDegree
int inDegree(N node)
Returns the count ofnode
's incoming edges (equal topredecessors(node).size()
) in a directed graph. In an undirected graph, returns thedegree(Object)
.If the count is greater than
Integer.MAX_VALUE
, returnsInteger.MAX_VALUE
.- Throws:
java.lang.IllegalArgumentException
- ifnode
is not an element of this graph
-
outDegree
int outDegree(N node)
Returns the count ofnode
's outgoing edges (equal tosuccessors(node).size()
) in a directed graph. In an undirected graph, returns thedegree(Object)
.If the count is greater than
Integer.MAX_VALUE
, returnsInteger.MAX_VALUE
.- Throws:
java.lang.IllegalArgumentException
- ifnode
is not an element of this graph
-
hasEdgeConnecting
boolean hasEdgeConnecting(N nodeU, N nodeV)
Returns true if there is an edge that directly connectsnodeU
tonodeV
. This is equivalent tonodes().contains(nodeU) && successors(nodeU).contains(nodeV)
.In an undirected graph, this is equal to
hasEdgeConnecting(nodeV, nodeU)
.- Since:
- 23.0
-
hasEdgeConnecting
boolean hasEdgeConnecting(EndpointPair<N> endpoints)
Returns true if there is an edge that directly connectsendpoints
(in the order, if any, specified byendpoints
). This is equivalent toedges().contains(endpoints)
.Unlike the other
EndpointPair
-accepting methods, this method does not throw if the endpoints are unordered; it simply returns false. This is for consistency with the behavior ofCollection#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 withedges().contains(endpoints)
.- Since:
- 27.1
-
-