Searched refs:dependencyGraph (Results 1 – 2 of 2) sorted by relevance
| /external/dagger2/java/dagger/model/ |
| D | BindingGraph.java | 236 ImmutableNetwork<Node, DependencyEdge> dependencyGraph = dependencyGraph(); in entryPointEdgesDependingOnBinding() local
239 dependencyGraph, reachableNodes(transpose(dependencyGraph).asGraph(), binding)); in entryPointEdgesDependingOnBinding()
276 private ImmutableNetwork<Node, DependencyEdge> dependencyGraph() { in dependencyGraph() method in BindingGraph
277 MutableNetwork<Node, DependencyEdge> dependencyGraph = in dependencyGraph() local
282 network().nodes().forEach(dependencyGraph::addNode); // include disconnected nodes in dependencyGraph()
287 dependencyGraph.addEdge(endpoints.source(), endpoints.target(), edge); in dependencyGraph()
289 return ImmutableNetwork.copyOf(dependencyGraph); in dependencyGraph()
|
| /external/dagger2/java/dagger/internal/codegen/bindinggraphvalidation/ |
| D | DependencyCycleValidator.java | 78 ImmutableNetwork<Node, DependencyEdge> dependencyGraph = in visitGraph() local
81 if (!Graphs.hasCycle(dependencyGraph)) { in visitGraph()
85 Set<EndpointPair<Node>> dependencyEndpointPairs = dependencyGraph.asGraph().edges(); in visitGraph()
88 cycleContainingEndpointPair(endpointPair, dependencyGraph, visited) in visitGraph()
95 ImmutableNetwork<Node, DependencyEdge> dependencyGraph, in cycleContainingEndpointPair() argument
104 shortestPath(dependencyGraph, endpoints.target(), endpoints.source()); in cycleContainingEndpointPair()
|