Uses of Annotation Interface
com.google.common.graph.ElementTypesAreNonnullByDefault
Packages that use ElementTypesAreNonnullByDefault
-
Uses of ElementTypesAreNonnullByDefault in com.google.common.graph
Classes in com.google.common.graph with annotations of type ElementTypesAreNonnullByDefaultModifier and TypeClassDescription(package private) class
This class provides a skeletal implementation ofBaseGraph
.(package private) class
A base implementation ofNetworkConnections
for directed networks.class
This class provides a skeletal implementation ofGraph
.(package private) class
A base class for builders that construct graphs with user-defined properties.class
AbstractNetwork<N,
E> This class provides a skeletal implementation ofNetwork
.(package private) class
A base implementation ofNetworkConnections
for undirected networks.class
AbstractValueGraph<N,
V> This class provides a skeletal implementation ofValueGraph
.(package private) interface
BaseGraph<N>
A non-public interface for the methods shared betweenGraph
andValueGraph
.(package private) final class
An implementation ofGraphConnections
for directed graphs.(package private) final class
An implementation ofNetworkConnections
for directed networks with parallel edges.(package private) final class
An implementation ofNetworkConnections
for directed networks.(package private) final class
A class to represent the set of edges connecting an (implicit) origin node to a target node.final class
ElementOrder<T>
Used to represent the order of elements in a data structure that supports different options for iteration order guarantees.class
EndpointPair<N>
An immutable pair representing the two endpoints of an edge in a graph.(package private) class
A class to facilitate the set returned byGraph.edges()
.(package private) class
(package private) class
ForwardingNetwork<N,
E> A class to allowNetwork
implementations to be backed by a provided delegate.(package private) class
ForwardingValueGraph<N,
V> A class to allowValueGraph
implementations to be backed by a provided delegate.interface
Graph<N>
An interface for graph-structured data, whose edges are anonymous entities with no identity or information of their own.final class
GraphBuilder<N>
A builder for constructing instances ofMutableGraph
orImmutableGraph
with user-defined properties.(package private) interface
GraphConnections<N,
V> An interface for representing and manipulating an origin node's adjacent nodes and edge values in aGraph
.(package private) final class
A utility class to hold various constants used by the Guava Graph library.final class
(package private) class
Supertype forGraphs
, containing the old signatures of methods whose signatures we've changed.class
AGraph
whose elements and structural relationships will never change.final class
ImmutableNetwork<N,
E> ANetwork
whose elements and structural relationships will never change.final class
ImmutableValueGraph<N,
V> AValueGraph
whose elements and structural relationships will never change.(package private) class
Abstract base class for an incident edges set that allows different implementations ofAbstractCollection.iterator()
.(package private) final class
A subclass of `ForwardingSet` that throws `IllegalStateException` on invocation of any method (except `hashCode` and `equals`) if the provided `Supplier` returns false.(package private) class
MapIteratorCache<K,
V> A map-like data structure that wraps a backing map and caches values while iterating throughMapIteratorCache.unmodifiableKeySet()
.(package private) final class
MapRetrievalCache<K,
V> AMapIteratorCache
that adds additional caching.(package private) class
A class to represent the set of edges connecting an (implicit) origin node to a target node.interface
MutableGraph<N>
A subinterface ofGraph
which adds mutation methods.interface
MutableNetwork<N,
E> A subinterface ofNetwork
which adds mutation methods.interface
MutableValueGraph<N,
V> A subinterface ofValueGraph
which adds mutation methods.interface
Network<N,
E> An interface for graph-structured data, whose edges are unique objects.final class
NetworkBuilder<N,
E> A builder for constructing instances ofMutableNetwork
orImmutableNetwork
with user-defined properties.(package private) interface
NetworkConnections<N,
E> An interface for representing and manipulating an origin node's adjacent nodes and incident edges in aNetwork
.interface
A functional interface for graph-structured data.(package private) final class
Standard implementation ofMutableGraph
that supports both directed and undirected graphs.(package private) final class
Standard implementation ofMutableNetwork
that supports both directed and undirected graphs.(package private) final class
Standard implementation ofMutableValueGraph
that supports both directed and undirected graphs.(package private) class
StandardNetwork<N,
E> Standard implementation ofNetwork
that supports the options supplied byNetworkBuilder
.(package private) class
StandardValueGraph<N,
V> Standard implementation ofValueGraph
that supports the options supplied byAbstractGraphBuilder
.interface
A functional interface for graph-structured data.class
Traverser<N>
An object that can traverse the nodes that are reachable from a specified (set of) start node(s) using a specifiedSuccessorsFunction
.(package private) final class
An implementation ofGraphConnections
for undirected graphs.(package private) final class
An implementation ofNetworkConnections
for undirected networks with parallel edges.(package private) final class
An implementation ofNetworkConnections
for undirected networks.interface
ValueGraph<N,
V> An interface for graph-structured data, whose edges have associated non-unique values.final class
ValueGraphBuilder<N,
V> A builder for constructing instances ofMutableValueGraph
orImmutableValueGraph
with user-defined properties.