Uses of Package
com.google.common.graph
Packages that use com.google.common.graph
Package
Description
An API for representing graph (node and edge) data.
Utility methods and classes for I/O; for example input streams, output streams, readers, writers,
and files.
-
Classes in com.google.common.graph used by com.google.common.graphClassDescriptionThis class provides a skeletal implementation of
BaseGraph.A base implementation ofNetworkConnectionsfor directed networks.This class provides a skeletal implementation ofGraph.A base class for builders that construct graphs with user-defined properties.This class provides a skeletal implementation ofNetwork.A base implementation ofNetworkConnectionsfor undirected networks.This class provides a skeletal implementation ofValueGraph.A non-public interface for the methods shared betweenGraphandValueGraph.An implementation ofGraphConnectionsfor directed graphs.A value class representing single connection between the origin node and another node.An implementation ofNetworkConnectionsfor directed networks with parallel edges.An implementation ofNetworkConnectionsfor directed networks.Used to represent the order of elements in a data structure that supports different options for iteration order guarantees.The type of ordering that this object specifies.Marks all "top-level" types as non-null in a way that is recognized by Kotlin.An immutable pair representing the two endpoints of an edge in a graph.A class to facilitate the set returned byGraph.edges().A class to allowNetworkimplementations to be backed by a provided delegate.A class to allowValueGraphimplementations to be backed by a provided delegate.An interface for graph-structured data, whose edges are anonymous entities with no identity or information of their own.A builder for constructing instances ofMutableGraphorImmutableGraphwith user-defined properties.An interface for representing and manipulating an origin node's adjacent nodes and edge values in aGraph.Singleton edge value forGraphimplementations backed byValueGraphs.An enum representing the state of a node during DFS.AGraphwhose elements and structural relationships will never change.A builder for creatingImmutableGraphinstances, especiallystatic finalgraphs.ANetworkwhose elements and structural relationships will never change.A builder for creatingImmutableNetworkinstances, especiallystatic finalnetworks.AValueGraphwhose elements and structural relationships will never change.A builder for creatingImmutableValueGraphinstances, especiallystatic finalgraphs.A map-like data structure that wraps a backing map and caches values while iterating throughMapIteratorCache.unmodifiableKeySet().A subinterface ofGraphwhich adds mutation methods.A subinterface ofNetworkwhich adds mutation methods.A subinterface ofValueGraphwhich adds mutation methods.An interface for graph-structured data, whose edges are unique objects.A builder for constructing instances ofMutableNetworkorImmutableNetworkwith user-defined properties.An interface for representing and manipulating an origin node's adjacent nodes and incident edges in aNetwork.A functional interface for graph-structured data.Standard implementation ofNetworkthat supports the options supplied byNetworkBuilder.Standard implementation ofValueGraphthat supports the options supplied byAbstractGraphBuilder.A functional interface for graph-structured data.An object that can traverse the nodes that are reachable from a specified (set of) start node(s) using a specifiedSuccessorsFunction.Poor man's method reference forDeque::addFirstandDeque::addLast.Abstracts away the difference between traversing a graph vs.An implementation ofGraphConnectionsfor undirected graphs.An implementation ofNetworkConnectionsfor undirected networks with parallel edges.An implementation ofNetworkConnectionsfor undirected networks.An interface for graph-structured data, whose edges have associated non-unique values.A builder for constructing instances ofMutableValueGraphorImmutableValueGraphwith user-defined properties. -
Classes in com.google.common.graph used by com.google.common.ioClassDescriptionA functional interface for graph-structured data.An object that can traverse the nodes that are reachable from a specified (set of) start node(s) using a specified
SuccessorsFunction.