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) classThis class provides a skeletal implementation ofBaseGraph.(package private) classA base implementation ofNetworkConnectionsfor directed networks.classThis class provides a skeletal implementation ofGraph.(package private) classA base class for builders that construct graphs with user-defined properties.classAbstractNetwork<N,E> This class provides a skeletal implementation ofNetwork.(package private) classA base implementation ofNetworkConnectionsfor undirected networks.classAbstractValueGraph<N,V> This class provides a skeletal implementation ofValueGraph.(package private) interfaceBaseGraph<N>A non-public interface for the methods shared betweenGraphandValueGraph.(package private) final classAn implementation ofGraphConnectionsfor directed graphs.(package private) final classAn implementation ofNetworkConnectionsfor directed networks with parallel edges.(package private) final classAn implementation ofNetworkConnectionsfor directed networks.(package private) final classA class to represent the set of edges connecting an (implicit) origin node to a target node.final classElementOrder<T>Used to represent the order of elements in a data structure that supports different options for iteration order guarantees.classEndpointPair<N>An immutable pair representing the two endpoints of an edge in a graph.(package private) classA class to facilitate the set returned byGraph.edges().(package private) class(package private) classForwardingNetwork<N,E> A class to allowNetworkimplementations to be backed by a provided delegate.(package private) classForwardingValueGraph<N,V> A class to allowValueGraphimplementations to be backed by a provided delegate.interfaceGraph<N>An interface for graph-structured data, whose edges are anonymous entities with no identity or information of their own.final classGraphBuilder<N>A builder for constructing instances ofMutableGraphorImmutableGraphwith user-defined properties.(package private) interfaceGraphConnections<N,V> An interface for representing and manipulating an origin node's adjacent nodes and edge values in aGraph.(package private) final classA utility class to hold various constants used by the Guava Graph library.final class(package private) classSupertype forGraphs, containing the old signatures of methods whose signatures we've changed.classAGraphwhose elements and structural relationships will never change.final classImmutableNetwork<N,E> ANetworkwhose elements and structural relationships will never change.final classImmutableValueGraph<N,V> AValueGraphwhose elements and structural relationships will never change.(package private) classAbstract base class for an incident edges set that allows different implementations ofAbstractCollection.iterator().(package private) final classA subclass of `ForwardingSet` that throws `IllegalStateException` on invocation of any method (except `hashCode` and `equals`) if the provided `Supplier` returns false.(package private) classMapIteratorCache<K,V> A map-like data structure that wraps a backing map and caches values while iterating throughMapIteratorCache.unmodifiableKeySet().(package private) final classMapRetrievalCache<K,V> AMapIteratorCachethat adds additional caching.(package private) classA class to represent the set of edges connecting an (implicit) origin node to a target node.interfaceMutableGraph<N>A subinterface ofGraphwhich adds mutation methods.interfaceMutableNetwork<N,E> A subinterface ofNetworkwhich adds mutation methods.interfaceMutableValueGraph<N,V> A subinterface ofValueGraphwhich adds mutation methods.interfaceNetwork<N,E> An interface for graph-structured data, whose edges are unique objects.final classNetworkBuilder<N,E> A builder for constructing instances ofMutableNetworkorImmutableNetworkwith user-defined properties.(package private) interfaceNetworkConnections<N,E> An interface for representing and manipulating an origin node's adjacent nodes and incident edges in aNetwork.interfaceA functional interface for graph-structured data.(package private) final classStandard implementation ofMutableGraphthat supports both directed and undirected graphs.(package private) final classStandard implementation ofMutableNetworkthat supports both directed and undirected graphs.(package private) final classStandard implementation ofMutableValueGraphthat supports both directed and undirected graphs.(package private) classStandardNetwork<N,E> Standard implementation ofNetworkthat supports the options supplied byNetworkBuilder.(package private) classStandardValueGraph<N,V> Standard implementation ofValueGraphthat supports the options supplied byAbstractGraphBuilder.interfaceA functional interface for graph-structured data.classTraverser<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 classAn implementation ofGraphConnectionsfor undirected graphs.(package private) final classAn implementation ofNetworkConnectionsfor undirected networks with parallel edges.(package private) final classAn implementation ofNetworkConnectionsfor undirected networks.interfaceValueGraph<N,V> An interface for graph-structured data, whose edges have associated non-unique values.final classValueGraphBuilder<N,V> A builder for constructing instances ofMutableValueGraphorImmutableValueGraphwith user-defined properties.