Uses of Interface
com.google.common.graph.Graph
Packages that use Graph
-
Uses of Graph in com.google.common.graph
Subinterfaces of Graph in com.google.common.graphModifier and TypeInterfaceDescriptioninterfaceMutableGraph<N>A subinterface ofGraphwhich adds mutation methods.Classes in com.google.common.graph that implement GraphModifier and TypeClassDescriptionclassThis class provides a skeletal implementation ofGraph.(package private) classprivate static classclassAGraphwhose elements and structural relationships will never change.(package private) final classStandard implementation ofMutableGraphthat supports both directed and undirected graphs.Fields in com.google.common.graph declared as GraphMethods in com.google.common.graph that return GraphModifier and TypeMethodDescriptionAbstractNetwork.asGraph()AbstractValueGraph.asGraph()Network.asGraph()Returns a live view of this network as aGraph.ValueGraph.asGraph()Returns a live view of this graph as aGraph.Graphs.TransposedGraph.delegate()static <N> Graph<N> GraphsBridgeMethods.transitiveClosure(Graph<N> graph) static <N> Graph<N> Returns a view ofgraphwith the direction (if any) of every edge reversed.Methods in com.google.common.graph with parameters of type GraphModifier and TypeMethodDescriptionprivate static booleanGraphs.canTraverseWithoutReusingEdge(Graph<?> graph, Object nextNode, Object previousNode) Determines whether an edge has already been used during traversal.private static <N> GraphConnections<N, GraphConstants.Presence> ImmutableGraph.connectionsOf(Graph<N> graph, N node) static <N> MutableGraph<N> Creates a mutable copy ofgraphwith the same nodes and edges.static <N> ImmutableGraph<N> Returns an immutable copy ofgraph.static <N> GraphBuilder<N> Returns aGraphBuilderinitialized with all properties queryable fromgraph.private static <N> ImmutableMap<N, GraphConnections<N, GraphConstants.Presence>> ImmutableGraph.getNodeConnections(Graph<N> graph) static <N> booleanReturns true ifgraphhas at least one cycle.static <N> MutableGraph<N> Graphs.inducedSubgraph(Graph<N> graph, Iterable<? extends N> nodes) Returns the subgraph ofgraphinduced bynodes.(package private) static <N> EndpointPair<N> Returns anEndpointPairrepresenting the endpoints of an edge ingraph.static <N> ImmutableSet<N> Graphs.reachableNodes(Graph<N> graph, N node) Returns the set of nodes that are reachable fromnode.static <N> Set<N> GraphsBridgeMethods.reachableNodes(Graph<N> graph, N node) private static <N> booleanGraphs.subgraphHasCycle(Graph<N> graph, Map<Object, Graphs.NodeVisitState> visitedNodes, N startNode) Performs a traversal of the nodes reachable fromstartNode.static <N> ImmutableGraph<N> Graphs.transitiveClosure(Graph<N> graph) Returns the transitive closure ofgraph.static <N> Graph<N> GraphsBridgeMethods.transitiveClosure(Graph<N> graph) static <N> Graph<N> Returns a view ofgraphwith the direction (if any) of every edge reversed.Constructors in com.google.common.graph with parameters of type Graph