Index (guava-graph 0.0.1 API)

A B C D E F G H I M N O P R S T U V
All Classes and Interfaces|All Packages

A

AbstractGraph<N> - Class in dev.mccue.guava.graph: This class provides a skeletal implementation of Graph.
AbstractGraph() - Constructor for class dev.mccue.guava.graph.AbstractGraph
AbstractNetwork<N,E> - Class in dev.mccue.guava.graph: This class provides a skeletal implementation of Network.
AbstractNetwork() - Constructor for class dev.mccue.guava.graph.AbstractNetwork
AbstractValueGraph<N,V> - Class in dev.mccue.guava.graph: This class provides a skeletal implementation of ValueGraph.
AbstractValueGraph() - Constructor for class dev.mccue.guava.graph.AbstractValueGraph
addEdge(EndpointPair<N>, E) - Method in class dev.mccue.guava.graph.ImmutableNetwork.Builder: Adds edge connecting endpoints.
addEdge(EndpointPair<N>, E) - Method in interface dev.mccue.guava.graph.MutableNetwork: Adds edge connecting endpoints.
addEdge(N, N, E) - Method in class dev.mccue.guava.graph.ImmutableNetwork.Builder: Adds edge connecting nodeU to nodeV.
addEdge(N, N, E) - Method in interface dev.mccue.guava.graph.MutableNetwork: Adds edge connecting nodeU to nodeV.
addNode(N) - Method in class dev.mccue.guava.graph.ImmutableGraph.Builder: Adds node if it is not already present.
addNode(N) - Method in class dev.mccue.guava.graph.ImmutableNetwork.Builder: Adds node if it is not already present.
addNode(N) - Method in class dev.mccue.guava.graph.ImmutableValueGraph.Builder: Adds node if it is not already present.
addNode(N) - Method in interface dev.mccue.guava.graph.MutableGraph: Adds node if it is not already present.
addNode(N) - Method in interface dev.mccue.guava.graph.MutableNetwork: Adds node if it is not already present.
addNode(N) - Method in interface dev.mccue.guava.graph.MutableValueGraph: Adds node if it is not already present.
adjacentEdges(E) - Method in class dev.mccue.guava.graph.AbstractNetwork
adjacentEdges(E) - Method in interface dev.mccue.guava.graph.Network: Returns the edges which have an incident node in common with edge.
adjacentNode(N) - Method in class dev.mccue.guava.graph.EndpointPair: Returns the node that is adjacent to node along the origin edge.
adjacentNodes(N) - Method in class dev.mccue.guava.graph.ImmutableGraph
adjacentNodes(N) - Method in interface dev.mccue.guava.graph.Graph: Returns the nodes which have an incident edge in common with node in this graph.
adjacentNodes(N) - Method in interface dev.mccue.guava.graph.Network: Returns the nodes which have an incident edge in common with node in this network.
adjacentNodes(N) - Method in class dev.mccue.guava.graph.ImmutableNetwork
adjacentNodes(N) - Method in class dev.mccue.guava.graph.ImmutableValueGraph
adjacentNodes(N) - Method in interface dev.mccue.guava.graph.ValueGraph: Returns the nodes which have an incident edge in common with node in this graph.
allowsParallelEdges() - Method in interface dev.mccue.guava.graph.Network: Returns true if this network allows parallel edges.
allowsParallelEdges() - Method in class dev.mccue.guava.graph.ImmutableNetwork
allowsParallelEdges(boolean) - Method in class dev.mccue.guava.graph.NetworkBuilder: Specifies whether the network will allow parallel edges.
allowsSelfLoops() - Method in class dev.mccue.guava.graph.ImmutableGraph
allowsSelfLoops() - Method in interface dev.mccue.guava.graph.Graph: Returns true if this graph allows self-loops (edges that connect a node to itself).
allowsSelfLoops() - Method in interface dev.mccue.guava.graph.Network: Returns true if this network allows self-loops (edges that connect a node to itself).
allowsSelfLoops() - Method in class dev.mccue.guava.graph.ImmutableNetwork
allowsSelfLoops() - Method in class dev.mccue.guava.graph.ImmutableValueGraph
allowsSelfLoops() - Method in interface dev.mccue.guava.graph.ValueGraph: Returns true if this graph allows self-loops (edges that connect a node to itself).
allowsSelfLoops(boolean) - Method in class dev.mccue.guava.graph.GraphBuilder: Specifies whether the graph will allow self-loops (edges that connect a node to itself).
allowsSelfLoops(boolean) - Method in class dev.mccue.guava.graph.NetworkBuilder: Specifies whether the network will allow self-loops (edges that connect a node to itself).
allowsSelfLoops(boolean) - Method in class dev.mccue.guava.graph.ValueGraphBuilder: Specifies whether the graph will allow self-loops (edges that connect a node to itself).
asGraph() - Method in class dev.mccue.guava.graph.AbstractNetwork
asGraph() - Method in class dev.mccue.guava.graph.AbstractValueGraph
asGraph() - Method in class dev.mccue.guava.graph.ImmutableNetwork
asGraph() - Method in class dev.mccue.guava.graph.ImmutableValueGraph
asGraph() - Method in interface dev.mccue.guava.graph.Network: Returns a live view of this network as a Graph.
asGraph() - Method in interface dev.mccue.guava.graph.ValueGraph: Returns a live view of this graph as a Graph.

B

breadthFirst(Iterable<? extends N>) - Method in class dev.mccue.guava.graph.Traverser: Returns an unmodifiable Iterable over the nodes reachable from any of the startNodes, in the order of a breadth-first traversal.
breadthFirst(N) - Method in class dev.mccue.guava.graph.Traverser: Returns an unmodifiable Iterable over the nodes reachable from startNode, in the order of a breadth-first traversal.
build() - Method in class dev.mccue.guava.graph.GraphBuilder: Returns an empty MutableGraph with the properties of this GraphBuilder.
build() - Method in class dev.mccue.guava.graph.ImmutableGraph.Builder: Returns a newly-created ImmutableGraph based on the contents of this Builder.
build() - Method in class dev.mccue.guava.graph.ImmutableNetwork.Builder: Returns a newly-created ImmutableNetwork based on the contents of this Builder.
build() - Method in class dev.mccue.guava.graph.ImmutableValueGraph.Builder: Returns a newly-created ImmutableValueGraph based on the contents of this Builder.
build() - Method in class dev.mccue.guava.graph.NetworkBuilder: Returns an empty MutableNetwork with the properties of this NetworkBuilder.
build() - Method in class dev.mccue.guava.graph.ValueGraphBuilder: Returns an empty MutableValueGraph with the properties of this ValueGraphBuilder.

C

comparator() - Method in class dev.mccue.guava.graph.ElementOrder: Returns the Comparator used.
copyOf(Graph<N>) - Static method in class dev.mccue.guava.graph.Graphs: Creates a mutable copy of graph with the same nodes and edges.
copyOf(Graph<N>) - Static method in class dev.mccue.guava.graph.ImmutableGraph: Returns an immutable copy of graph.
copyOf(ImmutableGraph<N>) - Static method in class dev.mccue.guava.graph.ImmutableGraph: Deprecated.
no need to use this
copyOf(ImmutableNetwork<N, E>) - Static method in class dev.mccue.guava.graph.ImmutableNetwork: Deprecated.
no need to use this
copyOf(ImmutableValueGraph<N, V>) - Static method in class dev.mccue.guava.graph.ImmutableValueGraph: Deprecated.
no need to use this
copyOf(Network<N, E>) - Static method in class dev.mccue.guava.graph.Graphs: Creates a mutable copy of network with the same nodes and edges.
copyOf(Network<N, E>) - Static method in class dev.mccue.guava.graph.ImmutableNetwork: Returns an immutable copy of network.
copyOf(ValueGraph<N, V>) - Static method in class dev.mccue.guava.graph.Graphs: Creates a mutable copy of graph with the same nodes, edges, and edge values.
copyOf(ValueGraph<N, V>) - Static method in class dev.mccue.guava.graph.ImmutableValueGraph: Returns an immutable copy of graph.

D

degree(N) - Method in class dev.mccue.guava.graph.ImmutableValueGraph
degree(N) - Method in class dev.mccue.guava.graph.AbstractNetwork
degree(N) - Method in class dev.mccue.guava.graph.ImmutableGraph
degree(N) - Method in interface dev.mccue.guava.graph.Graph: Returns the count of node's incident edges, counting self-loops twice (equivalently, the number of times an edge touches node).
degree(N) - Method in interface dev.mccue.guava.graph.Network: Returns the count of node's incident edges, counting self-loops twice (equivalently, the number of times an edge touches node).
degree(N) - Method in interface dev.mccue.guava.graph.ValueGraph: Returns the count of node's incident edges, counting self-loops twice (equivalently, the number of times an edge touches node).
depthFirstPostOrder(Iterable<? extends N>) - Method in class dev.mccue.guava.graph.Traverser: Returns an unmodifiable Iterable over the nodes reachable from any of the startNodes, in the order of a depth-first post-order traversal.
depthFirstPostOrder(N) - Method in class dev.mccue.guava.graph.Traverser: Returns an unmodifiable Iterable over the nodes reachable from startNode, in the order of a depth-first post-order traversal.
depthFirstPreOrder(Iterable<? extends N>) - Method in class dev.mccue.guava.graph.Traverser: Returns an unmodifiable Iterable over the nodes reachable from any of the startNodes, in the order of a depth-first pre-order traversal.
depthFirstPreOrder(N) - Method in class dev.mccue.guava.graph.Traverser: Returns an unmodifiable Iterable over the nodes reachable from startNode, in the order of a depth-first pre-order traversal.
dev.mccue.guava.graph - module dev.mccue.guava.graph
dev.mccue.guava.graph - package dev.mccue.guava.graph: An API for representing graph (node and edge) data.
directed() - Static method in class dev.mccue.guava.graph.GraphBuilder: Returns a GraphBuilder for building directed graphs.
directed() - Static method in class dev.mccue.guava.graph.NetworkBuilder: Returns a NetworkBuilder for building directed networks.
directed() - Static method in class dev.mccue.guava.graph.ValueGraphBuilder: Returns a ValueGraphBuilder for building directed graphs.

E

edgeConnecting(EndpointPair<N>) - Method in class dev.mccue.guava.graph.AbstractNetwork
edgeConnecting(EndpointPair<N>) - Method in interface dev.mccue.guava.graph.Network: Returns the single edge that directly connects endpoints (in the order, if any, specified by endpoints), if one is present, or Optional.empty() if no such edge exists.
edgeConnecting(N, N) - Method in class dev.mccue.guava.graph.AbstractNetwork
edgeConnecting(N, N) - Method in interface dev.mccue.guava.graph.Network: Returns the single edge that directly connects nodeU to nodeV, if one is present, or Optional.empty() if no such edge exists.
edgeConnectingOrNull(EndpointPair<N>) - Method in class dev.mccue.guava.graph.AbstractNetwork
edgeConnectingOrNull(EndpointPair<N>) - Method in interface dev.mccue.guava.graph.Network: Returns the single edge that directly connects endpoints (in the order, if any, specified by endpoints), if one is present, or null if no such edge exists.
edgeConnectingOrNull(N, N) - Method in class dev.mccue.guava.graph.AbstractNetwork
edgeConnectingOrNull(N, N) - Method in interface dev.mccue.guava.graph.Network: Returns the single edge that directly connects nodeU to nodeV, if one is present, or null if no such edge exists.
edgeCount() - Method in class dev.mccue.guava.graph.AbstractValueGraph: Returns the number of edges in this graph; used to calculate the size of Graph.edges().
edgeCount() - Method in class dev.mccue.guava.graph.ImmutableGraph: Defer to BaseGraph.edges() (based on Graph.successors(Object)) for full edges() implementation.
edgeCount() - Method in class dev.mccue.guava.graph.ImmutableValueGraph
edgeOrder() - Method in interface dev.mccue.guava.graph.Network: Returns the order of iteration for the elements of Network.edges().
edgeOrder() - Method in class dev.mccue.guava.graph.ImmutableNetwork
edgeOrder(ElementOrder<E1>) - Method in class dev.mccue.guava.graph.NetworkBuilder: Specifies the order of iteration for the elements of Network.edges().
edges() - Method in class dev.mccue.guava.graph.ImmutableValueGraph: An implementation of BaseGraph.edges() defined in terms of Graph.nodes() and SuccessorsFunction.successors(Object).
edges() - Method in interface dev.mccue.guava.graph.Graph: Returns all edges in this graph.
edges() - Method in interface dev.mccue.guava.graph.Network: Returns all edges in this network, in the order specified by Network.edgeOrder().
edges() - Method in class dev.mccue.guava.graph.ImmutableNetwork
edges() - Method in interface dev.mccue.guava.graph.ValueGraph: Returns all edges in this graph.
edgesConnecting(EndpointPair<N>) - Method in class dev.mccue.guava.graph.AbstractNetwork
edgesConnecting(EndpointPair<N>) - Method in interface dev.mccue.guava.graph.Network: Returns the set of edges that each directly connect endpoints (in the order, if any, specified by endpoints).
edgesConnecting(N, N) - Method in class dev.mccue.guava.graph.AbstractNetwork
edgesConnecting(N, N) - Method in interface dev.mccue.guava.graph.Network: Returns the set of edges that each directly connect nodeU to nodeV.
edgesConnecting(N, N) - Method in class dev.mccue.guava.graph.ImmutableNetwork
edgeValue(EndpointPair<N>) - Method in class dev.mccue.guava.graph.AbstractValueGraph
edgeValue(EndpointPair<N>) - Method in interface dev.mccue.guava.graph.ValueGraph: Returns the value of the edge that connects endpoints (in the order, if any, specified by endpoints), if one is present; otherwise, returns Optional.empty().
edgeValue(N, N) - Method in class dev.mccue.guava.graph.AbstractValueGraph
edgeValue(N, N) - Method in interface dev.mccue.guava.graph.ValueGraph: Returns the value of the edge that connects nodeU to nodeV (in the order, if any, specified by endpoints), if one is present; otherwise, returns Optional.empty().
edgeValueOrDefault(EndpointPair<N>, V) - Method in class dev.mccue.guava.graph.ImmutableValueGraph
edgeValueOrDefault(EndpointPair<N>, V) - Method in interface dev.mccue.guava.graph.ValueGraph: Returns the value of the edge that connects endpoints (in the order, if any, specified by endpoints), if one is present; otherwise, returns defaultValue.
edgeValueOrDefault(N, N, V) - Method in class dev.mccue.guava.graph.ImmutableValueGraph
edgeValueOrDefault(N, N, V) - Method in interface dev.mccue.guava.graph.ValueGraph: Returns the value of the edge that connects nodeU to nodeV, if one is present; otherwise, returns defaultValue.
ElementOrder<T> - Class in dev.mccue.guava.graph: Used to represent the order of elements in a data structure that supports different options for iteration order guarantees.
ElementOrder.Type - Enum in dev.mccue.guava.graph: The type of ordering that this object specifies.
EndpointPair<N> - Class in dev.mccue.guava.graph: An immutable pair representing the two endpoints of an edge in a graph.
equals(Object) - Method in class dev.mccue.guava.graph.AbstractGraph
equals(Object) - Method in class dev.mccue.guava.graph.AbstractNetwork
equals(Object) - Method in class dev.mccue.guava.graph.AbstractValueGraph
equals(Object) - Method in class dev.mccue.guava.graph.ElementOrder
equals(Object) - Method in class dev.mccue.guava.graph.EndpointPair: Two ordered EndpointPairs are equal if their EndpointPair.source() and EndpointPair.target() are equal.
equals(Object) - Method in interface dev.mccue.guava.graph.Graph: Returns true iff object is a Graph that has the same elements and the same structural relationships as those in this graph.
equals(Object) - Method in interface dev.mccue.guava.graph.Network: Returns true iff object is a Network that has the same elements and the same structural relationships as those in this network.
equals(Object) - Method in interface dev.mccue.guava.graph.ValueGraph: Returns true iff object is a ValueGraph that has the same elements and the same structural relationships as those in this graph.
expectedEdgeCount(int) - Method in class dev.mccue.guava.graph.NetworkBuilder: Specifies the expected number of edges in the network.
expectedNodeCount(int) - Method in class dev.mccue.guava.graph.GraphBuilder: Specifies the expected number of nodes in the graph.
expectedNodeCount(int) - Method in class dev.mccue.guava.graph.NetworkBuilder: Specifies the expected number of nodes in the network.
expectedNodeCount(int) - Method in class dev.mccue.guava.graph.ValueGraphBuilder: Specifies the expected number of nodes in the graph.

F

forGraph(SuccessorsFunction<N>) - Static method in class dev.mccue.guava.graph.Traverser: Creates a new traverser for the given general graph.
forTree(SuccessorsFunction<N>) - Static method in class dev.mccue.guava.graph.Traverser: Creates a new traverser for a directed acyclic graph that has at most one path from the start node(s) to any node reachable from the start node(s), and has no paths from any start node to any other start node, such as a tree or forest.
from(Graph<N>) - Static method in class dev.mccue.guava.graph.GraphBuilder: Returns a GraphBuilder initialized with all properties queryable from graph.
from(Network<N, E>) - Static method in class dev.mccue.guava.graph.NetworkBuilder: Returns a NetworkBuilder initialized with all properties queryable from network.
from(ValueGraph<N, V>) - Static method in class dev.mccue.guava.graph.ValueGraphBuilder: Returns a ValueGraphBuilder initialized with all properties queryable from graph.

G

Graph<N> - Interface in dev.mccue.guava.graph: An interface for graph-structured data, whose edges are anonymous entities with no identity or information of their own.
GraphBuilder<N> - Class in dev.mccue.guava.graph: A builder for constructing instances of MutableGraph or ImmutableGraph with user-defined properties.
Graphs - Class in dev.mccue.guava.graph: Static utility methods for Graph, ValueGraph, and Network instances.

H

hasCycle(Graph<N>) - Static method in class dev.mccue.guava.graph.Graphs: Returns true if graph has at least one cycle.
hasCycle(Network<?, ?>) - Static method in class dev.mccue.guava.graph.Graphs: Returns true if network has at least one cycle.
hasEdgeConnecting(EndpointPair<N>) - Method in class dev.mccue.guava.graph.AbstractValueGraph
hasEdgeConnecting(EndpointPair<N>) - Method in class dev.mccue.guava.graph.AbstractNetwork
hasEdgeConnecting(EndpointPair<N>) - Method in class dev.mccue.guava.graph.ImmutableGraph
hasEdgeConnecting(EndpointPair<N>) - Method in interface dev.mccue.guava.graph.Graph: Returns true if there is an edge that directly connects endpoints (in the order, if any, specified by endpoints).
hasEdgeConnecting(EndpointPair<N>) - Method in interface dev.mccue.guava.graph.Network: Returns true if there is an edge that directly connects endpoints (in the order, if any, specified by endpoints).
hasEdgeConnecting(EndpointPair<N>) - Method in class dev.mccue.guava.graph.ImmutableValueGraph
hasEdgeConnecting(EndpointPair<N>) - Method in interface dev.mccue.guava.graph.ValueGraph: Returns true if there is an edge that directly connects endpoints (in the order, if any, specified by endpoints).
hasEdgeConnecting(N, N) - Method in class dev.mccue.guava.graph.AbstractValueGraph
hasEdgeConnecting(N, N) - Method in class dev.mccue.guava.graph.AbstractNetwork
hasEdgeConnecting(N, N) - Method in class dev.mccue.guava.graph.ImmutableGraph
hasEdgeConnecting(N, N) - Method in interface dev.mccue.guava.graph.Graph: Returns true if there is an edge that directly connects nodeU to nodeV.
hasEdgeConnecting(N, N) - Method in interface dev.mccue.guava.graph.Network: Returns true if there is an edge that directly connects nodeU to nodeV.
hasEdgeConnecting(N, N) - Method in class dev.mccue.guava.graph.ImmutableValueGraph
hasEdgeConnecting(N, N) - Method in interface dev.mccue.guava.graph.ValueGraph: Returns true if there is an edge that directly connects nodeU to nodeV.
hashCode() - Method in class dev.mccue.guava.graph.AbstractGraph
hashCode() - Method in class dev.mccue.guava.graph.AbstractNetwork
hashCode() - Method in class dev.mccue.guava.graph.AbstractValueGraph
hashCode() - Method in class dev.mccue.guava.graph.ElementOrder
hashCode() - Method in class dev.mccue.guava.graph.EndpointPair: The hashcode of an ordered EndpointPair is equal to Objects.hashCode(source(), target()).
hashCode() - Method in interface dev.mccue.guava.graph.Graph: Returns the hash code for this graph.
hashCode() - Method in interface dev.mccue.guava.graph.Network: Returns the hash code for this network.
hashCode() - Method in interface dev.mccue.guava.graph.ValueGraph: Returns the hash code for this graph.

I

immutable() - Method in class dev.mccue.guava.graph.GraphBuilder: Returns an ImmutableGraph.Builder with the properties of this GraphBuilder.
immutable() - Method in class dev.mccue.guava.graph.NetworkBuilder: Returns an ImmutableNetwork.Builder with the properties of this NetworkBuilder.
immutable() - Method in class dev.mccue.guava.graph.ValueGraphBuilder: Returns an ImmutableValueGraph.Builder with the properties of this ValueGraphBuilder.
ImmutableGraph<N> - Class in dev.mccue.guava.graph: A Graph whose elements and structural relationships will never change.
ImmutableGraph.Builder<N> - Class in dev.mccue.guava.graph: A builder for creating ImmutableGraph instances, especially static final graphs.
ImmutableNetwork<N,E> - Class in dev.mccue.guava.graph: A Network whose elements and structural relationships will never change.
ImmutableNetwork.Builder<N,E> - Class in dev.mccue.guava.graph: A builder for creating ImmutableNetwork instances, especially static final networks.
ImmutableValueGraph<N,V> - Class in dev.mccue.guava.graph: A ValueGraph whose elements and structural relationships will never change.
ImmutableValueGraph.Builder<N,V> - Class in dev.mccue.guava.graph: A builder for creating ImmutableValueGraph instances, especially static final graphs.
incidentEdgeOrder() - Method in class dev.mccue.guava.graph.AbstractValueGraph
incidentEdgeOrder() - Method in interface dev.mccue.guava.graph.Graph: Returns an ElementOrder that specifies the order of iteration for the elements of Graph.edges(), Graph.adjacentNodes(Object), Graph.predecessors(Object), Graph.successors(Object) and Graph.incidentEdges(Object).
incidentEdgeOrder() - Method in class dev.mccue.guava.graph.ImmutableGraph
incidentEdgeOrder() - Method in class dev.mccue.guava.graph.ImmutableValueGraph
incidentEdgeOrder() - Method in interface dev.mccue.guava.graph.ValueGraph: Returns an ElementOrder that specifies the order of iteration for the elements of ValueGraph.edges(), ValueGraph.adjacentNodes(Object), ValueGraph.predecessors(Object), ValueGraph.successors(Object) and ValueGraph.incidentEdges(Object).
incidentEdgeOrder(ElementOrder<N1>) - Method in class dev.mccue.guava.graph.GraphBuilder: Specifies the order of iteration for the elements of Graph.edges(), Graph.adjacentNodes(Object), Graph.predecessors(Object), Graph.successors(Object) and Graph.incidentEdges(Object).
incidentEdgeOrder(ElementOrder<N1>) - Method in class dev.mccue.guava.graph.ValueGraphBuilder: Specifies the order of iteration for the elements of ValueGraph.edges(), ValueGraph.adjacentNodes(Object), ValueGraph.predecessors(Object), ValueGraph.successors(Object) and ValueGraph.incidentEdges(Object).
incidentEdges(N) - Method in class dev.mccue.guava.graph.AbstractValueGraph
incidentEdges(N) - Method in class dev.mccue.guava.graph.ImmutableGraph
incidentEdges(N) - Method in interface dev.mccue.guava.graph.Graph: Returns the edges in this graph whose endpoints include node.
incidentEdges(N) - Method in interface dev.mccue.guava.graph.Network: Returns the edges whose incident nodes in this network include node.
incidentEdges(N) - Method in class dev.mccue.guava.graph.ImmutableNetwork
incidentEdges(N) - Method in class dev.mccue.guava.graph.ImmutableValueGraph
incidentEdges(N) - Method in interface dev.mccue.guava.graph.ValueGraph: Returns the edges in this graph whose endpoints include node.
incidentNodes(E) - Method in interface dev.mccue.guava.graph.Network: Returns the nodes which are the endpoints of edge in this network.
incidentNodes(E) - Method in class dev.mccue.guava.graph.ImmutableNetwork
inDegree(N) - Method in class dev.mccue.guava.graph.ImmutableValueGraph
inDegree(N) - Method in class dev.mccue.guava.graph.AbstractNetwork
inDegree(N) - Method in class dev.mccue.guava.graph.ImmutableGraph
inDegree(N) - Method in interface dev.mccue.guava.graph.Graph: Returns the count of node's incoming edges (equal to predecessors(node).size()) in a directed graph.
inDegree(N) - Method in interface dev.mccue.guava.graph.Network: Returns the count of node's incoming edges in a directed network.
inDegree(N) - Method in interface dev.mccue.guava.graph.ValueGraph: Returns the count of node's incoming edges (equal to predecessors(node).size()) in a directed graph.
inducedSubgraph(Graph<N>, Iterable<? extends N>) - Static method in class dev.mccue.guava.graph.Graphs: Returns the subgraph of graph induced by nodes.
inducedSubgraph(Network<N, E>, Iterable<? extends N>) - Static method in class dev.mccue.guava.graph.Graphs: Returns the subgraph of network induced by nodes.
inducedSubgraph(ValueGraph<N, V>, Iterable<? extends N>) - Static method in class dev.mccue.guava.graph.Graphs: Returns the subgraph of graph induced by nodes.
inEdges(N) - Method in interface dev.mccue.guava.graph.Network: Returns all edges in this network which can be traversed in the direction (if any) of the edge to end at node.
inEdges(N) - Method in class dev.mccue.guava.graph.ImmutableNetwork
insertion() - Static method in class dev.mccue.guava.graph.ElementOrder: Returns an instance which specifies that insertion ordering is guaranteed.
INSERTION - Enum constant in enum dev.mccue.guava.graph.ElementOrder.Type
isDirected() - Method in class dev.mccue.guava.graph.ImmutableGraph
isDirected() - Method in interface dev.mccue.guava.graph.Graph: Returns true if the edges in this graph are directed.
isDirected() - Method in interface dev.mccue.guava.graph.Network: Returns true if the edges in this network are directed.
isDirected() - Method in class dev.mccue.guava.graph.ImmutableNetwork
isDirected() - Method in class dev.mccue.guava.graph.ImmutableValueGraph
isDirected() - Method in interface dev.mccue.guava.graph.ValueGraph: Returns true if the edges in this graph are directed.
isOrdered() - Method in class dev.mccue.guava.graph.EndpointPair: Returns true if this EndpointPair is an ordered pair (i.e.
isOrderingCompatible(EndpointPair<?>) - Method in class dev.mccue.guava.graph.ImmutableValueGraph: Returns true iff endpoints' ordering is compatible with the directionality of this graph.
isOrderingCompatible(EndpointPair<?>) - Method in class dev.mccue.guava.graph.AbstractNetwork
iterator() - Method in class dev.mccue.guava.graph.EndpointPair: Iterates in the order EndpointPair.nodeU(), EndpointPair.nodeV().

M

MutableGraph<N> - Interface in dev.mccue.guava.graph: A subinterface of Graph which adds mutation methods.
MutableNetwork<N,E> - Interface in dev.mccue.guava.graph: A subinterface of Network which adds mutation methods.
MutableValueGraph<N,V> - Interface in dev.mccue.guava.graph: A subinterface of ValueGraph which adds mutation methods.

N

natural() - Static method in class dev.mccue.guava.graph.ElementOrder: Returns an instance which specifies that the natural ordering of the elements is guaranteed.
Network<N,E> - Interface in dev.mccue.guava.graph: An interface for graph-structured data, whose edges are unique objects.
NetworkBuilder<N,E> - Class in dev.mccue.guava.graph: A builder for constructing instances of MutableNetwork or ImmutableNetwork with user-defined properties.
nodeOrder() - Method in class dev.mccue.guava.graph.ImmutableGraph
nodeOrder() - Method in interface dev.mccue.guava.graph.Graph: Returns the order of iteration for the elements of Graph.nodes().
nodeOrder() - Method in interface dev.mccue.guava.graph.Network: Returns the order of iteration for the elements of Network.nodes().
nodeOrder() - Method in class dev.mccue.guava.graph.ImmutableNetwork
nodeOrder() - Method in class dev.mccue.guava.graph.ImmutableValueGraph
nodeOrder() - Method in interface dev.mccue.guava.graph.ValueGraph: Returns the order of iteration for the elements of ValueGraph.nodes().
nodeOrder(ElementOrder<N1>) - Method in class dev.mccue.guava.graph.GraphBuilder: Specifies the order of iteration for the elements of Graph.nodes().
nodeOrder(ElementOrder<N1>) - Method in class dev.mccue.guava.graph.NetworkBuilder: Specifies the order of iteration for the elements of Network.nodes().
nodeOrder(ElementOrder<N1>) - Method in class dev.mccue.guava.graph.ValueGraphBuilder: Specifies the order of iteration for the elements of Graph.nodes().
nodes() - Method in class dev.mccue.guava.graph.ImmutableGraph
nodes() - Method in interface dev.mccue.guava.graph.Graph: Returns all nodes in this graph, in the order specified by Graph.nodeOrder().
nodes() - Method in interface dev.mccue.guava.graph.Network: Returns all nodes in this network, in the order specified by Network.nodeOrder().
nodes() - Method in class dev.mccue.guava.graph.ImmutableNetwork
nodes() - Method in class dev.mccue.guava.graph.ImmutableValueGraph
nodes() - Method in interface dev.mccue.guava.graph.ValueGraph: Returns all nodes in this graph, in the order specified by ValueGraph.nodeOrder().
nodeU() - Method in class dev.mccue.guava.graph.EndpointPair: If this EndpointPair EndpointPair.isOrdered() returns the EndpointPair.source(); otherwise, returns an arbitrary (but consistent) endpoint of the origin edge.
nodeV() - Method in class dev.mccue.guava.graph.EndpointPair: Returns the node adjacent to EndpointPair.nodeU() along the origin edge.

O

ordered(N, N) - Static method in class dev.mccue.guava.graph.EndpointPair: Returns an EndpointPair representing the endpoints of a directed edge.
outDegree(N) - Method in class dev.mccue.guava.graph.ImmutableValueGraph
outDegree(N) - Method in class dev.mccue.guava.graph.AbstractNetwork
outDegree(N) - Method in class dev.mccue.guava.graph.ImmutableGraph
outDegree(N) - Method in interface dev.mccue.guava.graph.Graph: Returns the count of node's outgoing edges (equal to successors(node).size()) in a directed graph.
outDegree(N) - Method in interface dev.mccue.guava.graph.Network: Returns the count of node's outgoing edges in a directed network.
outDegree(N) - Method in interface dev.mccue.guava.graph.ValueGraph: Returns the count of node's outgoing edges (equal to successors(node).size()) in a directed graph.
outEdges(N) - Method in interface dev.mccue.guava.graph.Network: Returns all edges in this network which can be traversed in the direction (if any) of the edge starting from node.
outEdges(N) - Method in class dev.mccue.guava.graph.ImmutableNetwork

P

predecessors(N) - Method in class dev.mccue.guava.graph.ImmutableGraph
predecessors(N) - Method in interface dev.mccue.guava.graph.Graph: 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.
predecessors(N) - Method in interface dev.mccue.guava.graph.Network: Returns all nodes in this network adjacent to node which can be reached by traversing node's incoming edges against the direction (if any) of the edge.
predecessors(N) - Method in interface dev.mccue.guava.graph.PredecessorsFunction: 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.
predecessors(N) - Method in class dev.mccue.guava.graph.ImmutableNetwork
predecessors(N) - Method in class dev.mccue.guava.graph.ImmutableValueGraph
predecessors(N) - Method in interface dev.mccue.guava.graph.ValueGraph: 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.
PredecessorsFunction<N> - Interface in dev.mccue.guava.graph: A functional interface for graph-structured data.
putEdge(EndpointPair<N>) - Method in class dev.mccue.guava.graph.ImmutableGraph.Builder: Adds an edge connecting endpoints (in the order, if any, specified by endpoints) if one is not already present.
putEdge(EndpointPair<N>) - Method in interface dev.mccue.guava.graph.MutableGraph: Adds an edge connecting endpoints (in the order, if any, specified by endpoints) if one is not already present.
putEdge(N, N) - Method in class dev.mccue.guava.graph.ImmutableGraph.Builder: Adds an edge connecting nodeU to nodeV if one is not already present.
putEdge(N, N) - Method in interface dev.mccue.guava.graph.MutableGraph: Adds an edge connecting nodeU to nodeV if one is not already present.
putEdgeValue(EndpointPair<N>, V) - Method in class dev.mccue.guava.graph.ImmutableValueGraph.Builder: Adds an edge connecting endpoints if one is not already present, and sets a value for that edge to value (overwriting the existing value, if any).
putEdgeValue(EndpointPair<N>, V) - Method in interface dev.mccue.guava.graph.MutableValueGraph: Adds an edge connecting endpoints if one is not already present, and sets a value for that edge to value (overwriting the existing value, if any).
putEdgeValue(N, N, V) - Method in class dev.mccue.guava.graph.ImmutableValueGraph.Builder: Adds an edge connecting nodeU to nodeV if one is not already present, and sets a value for that edge to value (overwriting the existing value, if any).
putEdgeValue(N, N, V) - Method in interface dev.mccue.guava.graph.MutableValueGraph: Adds an edge connecting nodeU to nodeV if one is not already present, and sets a value for that edge to value (overwriting the existing value, if any).

R

reachableNodes(Graph<N>, N) - Static method in class dev.mccue.guava.graph.Graphs: Returns the set of nodes that are reachable from node.
removeEdge(EndpointPair<N>) - Method in interface dev.mccue.guava.graph.MutableGraph: Removes the edge connecting endpoints, if it is present.
removeEdge(EndpointPair<N>) - Method in interface dev.mccue.guava.graph.MutableValueGraph: Removes the edge connecting endpoints, if it is present.
removeEdge(E) - Method in interface dev.mccue.guava.graph.MutableNetwork: Removes edge from this network, if it is present.
removeEdge(N, N) - Method in interface dev.mccue.guava.graph.MutableGraph: Removes the edge connecting nodeU to nodeV, if it is present.
removeEdge(N, N) - Method in interface dev.mccue.guava.graph.MutableValueGraph: Removes the edge connecting nodeU to nodeV, if it is present.
removeNode(N) - Method in interface dev.mccue.guava.graph.MutableGraph: Removes node if it is present; all edges incident to node will also be removed.
removeNode(N) - Method in interface dev.mccue.guava.graph.MutableNetwork: Removes node if it is present; all edges incident to node will also be removed.
removeNode(N) - Method in interface dev.mccue.guava.graph.MutableValueGraph: Removes node if it is present; all edges incident to node will also be removed.

S

sorted(Comparator<S>) - Static method in class dev.mccue.guava.graph.ElementOrder: Returns an instance which specifies that the ordering of the elements is guaranteed to be determined by comparator.
SORTED - Enum constant in enum dev.mccue.guava.graph.ElementOrder.Type
source() - Method in class dev.mccue.guava.graph.EndpointPair: If this EndpointPair EndpointPair.isOrdered(), returns the node which is the source.
stable() - Static method in class dev.mccue.guava.graph.ElementOrder: Returns an instance which specifies that ordering is guaranteed to be always be the same across iterations, and across releases.
STABLE - Enum constant in enum dev.mccue.guava.graph.ElementOrder.Type
successors(N) - Method in class dev.mccue.guava.graph.ImmutableGraph
successors(N) - Method in interface dev.mccue.guava.graph.Graph: 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.
successors(N) - Method in interface dev.mccue.guava.graph.Network: Returns all nodes in this network adjacent to node which can be reached by traversing node's outgoing edges in the direction (if any) of the edge.
successors(N) - Method in class dev.mccue.guava.graph.ImmutableNetwork
successors(N) - Method in class dev.mccue.guava.graph.ImmutableValueGraph
successors(N) - Method in interface dev.mccue.guava.graph.SuccessorsFunction: 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.
successors(N) - Method in interface dev.mccue.guava.graph.ValueGraph: 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.
SuccessorsFunction<N> - Interface in dev.mccue.guava.graph: A functional interface for graph-structured data.

T

target() - Method in class dev.mccue.guava.graph.EndpointPair: If this EndpointPair EndpointPair.isOrdered(), returns the node which is the target.
toString() - Method in class dev.mccue.guava.graph.AbstractGraph: Returns a string representation of this graph.
toString() - Method in class dev.mccue.guava.graph.AbstractNetwork: Returns a string representation of this network.
toString() - Method in class dev.mccue.guava.graph.AbstractValueGraph: Returns a string representation of this graph.
toString() - Method in class dev.mccue.guava.graph.ElementOrder
transitiveClosure(Graph<N>) - Static method in class dev.mccue.guava.graph.Graphs: Returns the transitive closure of graph.
transpose(Graph<N>) - Static method in class dev.mccue.guava.graph.Graphs: Returns a view of graph with the direction (if any) of every edge reversed.
transpose(Network<N, E>) - Static method in class dev.mccue.guava.graph.Graphs: Returns a view of network with the direction (if any) of every edge reversed.
transpose(ValueGraph<N, V>) - Static method in class dev.mccue.guava.graph.Graphs: Returns a view of graph with the direction (if any) of every edge reversed.
Traverser<N> - Class in dev.mccue.guava.graph: An object that can traverse the nodes that are reachable from a specified (set of) start node(s) using a specified SuccessorsFunction.
type() - Method in class dev.mccue.guava.graph.ElementOrder: Returns the type of ordering used.

U

undirected() - Static method in class dev.mccue.guava.graph.GraphBuilder: Returns a GraphBuilder for building undirected graphs.
undirected() - Static method in class dev.mccue.guava.graph.NetworkBuilder: Returns a NetworkBuilder for building undirected networks.
undirected() - Static method in class dev.mccue.guava.graph.ValueGraphBuilder: Returns a ValueGraphBuilder for building undirected graphs.
unordered() - Static method in class dev.mccue.guava.graph.ElementOrder: Returns an instance which specifies that no ordering is guaranteed.
unordered(N, N) - Static method in class dev.mccue.guava.graph.EndpointPair: Returns an EndpointPair representing the endpoints of an undirected edge.
UNORDERED - Enum constant in enum dev.mccue.guava.graph.ElementOrder.Type

V

validateEndpoints(EndpointPair<?>) - Method in class dev.mccue.guava.graph.ImmutableValueGraph: Throws IllegalArgumentException if the ordering of endpoints is not compatible with the directionality of this graph.
validateEndpoints(EndpointPair<?>) - Method in class dev.mccue.guava.graph.AbstractNetwork: Throws an IllegalArgumentException if the ordering of endpoints is not compatible with the directionality of this graph.
ValueGraph<N,V> - Interface in dev.mccue.guava.graph: An interface for graph-structured data, whose edges have associated non-unique values.
ValueGraphBuilder<N,V> - Class in dev.mccue.guava.graph: A builder for constructing instances of MutableValueGraph or ImmutableValueGraph with user-defined properties.
valueOf(String) - Static method in enum dev.mccue.guava.graph.ElementOrder.Type: Returns the enum constant of this type with the specified name.
values() - Static method in enum dev.mccue.guava.graph.ElementOrder.Type: Returns an array containing the constants of this enum type, in the order they are declared.

A B C D E F G H I M N O P R S T U V
All Classes and Interfaces|All Packages