dagger.internal.codegen

Class DaggerGraphs

java.lang.Object

dagger.internal.codegen.DaggerGraphs

public final class DaggerGraphs
extends java.lang.Object

Utility methods for com.google.common.graph types.

Method Summary

Modifier and Type	Method and Description
static <N> com.google.common.collect.ImmutableList<N>	shortestPath(com.google.common.graph.SuccessorsFunction<N> graph, N nodeU, N nodeV) Returns a shortest path from nodeU to nodeV in graph as a list of the nodes visited in sequence, including both nodeU and nodeV.
static <N> com.google.common.collect.ImmutableSet<N>	unreachableNodes(com.google.common.graph.Graph<N> graph, N node) Returns the nodes in a graph that are not reachable from a node.

Methods inherited from class java.lang.Object

clone, equals, finalize, getClass, hashCode, notify, notifyAll, toString, wait, wait, wait

Method Detail

shortestPath

public static <N> com.google.common.collect.ImmutableList<N> shortestPath(com.google.common.graph.SuccessorsFunction<N> graph,
                                                                          N nodeU,
                                                                          N nodeV)

Returns a shortest path from nodeU to nodeV in graph as a list of the nodes visited in sequence, including both nodeU and nodeV. (Note that there may be many possible shortest paths.)

If nodeV is not reachable from nodeU, the list returned is empty.

Throws:

java.lang.IllegalArgumentException - if nodeU or nodeV is not present in graph

unreachableNodes

public static <N> com.google.common.collect.ImmutableSet<N> unreachableNodes(com.google.common.graph.Graph<N> graph,
                                                                             N node)

Returns the nodes in a graph that are not reachable from a node.