Package | Description |
---|---|
org.grouplens.grapht | |
org.grouplens.grapht.graph |
Graph data structure exposed by Grapht.
|
org.grouplens.grapht.solver |
Dependency resolution.
|
Modifier and Type | Method and Description |
---|---|
Instantiator |
InjectionContainer.makeInstantiator(DAGNode<Component,Dependency> node,
com.google.common.collect.SetMultimap<DAGNode<Component,Dependency>,DAGEdge<Component,Dependency>> backEdges)
Get a provider that, when invoked, will return an instance of the component represented
by a graph with back edges.
|
Modifier and Type | Method and Description |
---|---|
static <V,E> DAGEdge<V,E> |
DAGEdge.create(DAGNode<V,E> head,
DAGNode<V,E> tail,
E label) |
DAGEdge<V,E> |
DAGNode.findEdgeBFS(com.google.common.base.Predicate<? super DAGEdge<V,E>> pred)
Do a breadth-first search for an edge.
|
DAGEdge<V,E> |
DAGNode.getOutgoingEdge(DAGNode<V,E> target,
E label)
Get the outgoing edge with the specified target and label, if it exists.
|
DAGEdge<V,E> |
DAGNode.getOutgoingEdgeWithLabel(E label)
Get an outgoing edge from this node with the specified label, if it exists.
|
DAGEdge<V,E> |
DAGNode.getOutgoingEdgeWithLabel(com.google.common.base.Predicate<? super E> predicate)
Search for an outgoing edge by a predicate.
|
Modifier and Type | Method and Description |
---|---|
static <V,E> com.google.common.base.Function<DAGEdge<V,E>,DAGNode<V,E>> |
DAGEdge.extractHead() |
static <V,E> com.google.common.base.Function<DAGEdge<V,E>,DAGNode<V,E>> |
DAGEdge.extractTail() |
Set<DAGEdge<V,E>> |
DAGNode.getIncomingEdges(DAGNode<V,E> node)
Get the incoming edges to a node reachable from this node.
|
Set<DAGEdge<V,E>> |
DAGNode.getOutgoingEdges()
Get the outgoing edges of this node.
|
static <V,E> com.google.common.base.Predicate<DAGEdge<V,E>> |
DAGEdge.headMatches(com.google.common.base.Predicate<? super DAGNode<V,E>> pred) |
static <E> com.google.common.base.Predicate<DAGEdge<?,E>> |
DAGEdge.labelMatches(com.google.common.base.Predicate<? super E> pred) |
static <V,E> com.google.common.base.Predicate<DAGEdge<V,E>> |
DAGEdge.tailMatches(com.google.common.base.Predicate<? super DAGNode<V,E>> pred) |
static <V,E> com.google.common.base.Function<DAGEdge<V,E>,DAGEdge<V,E>> |
DAGEdge.transformNodes(com.google.common.base.Function<? super DAGNode<V,E>,? extends DAGNode<V,E>> func)
Transform an edge.
|
static <V,E> com.google.common.base.Function<DAGEdge<V,E>,DAGEdge<V,E>> |
DAGEdge.transformNodes(com.google.common.base.Function<? super DAGNode<V,E>,? extends DAGNode<V,E>> func)
Transform an edge.
|
Modifier and Type | Method and Description |
---|---|
DAGEdge<V,E> |
DAGNode.findEdgeBFS(com.google.common.base.Predicate<? super DAGEdge<V,E>> pred)
Do a breadth-first search for an edge.
|
DAGNode<V,E> |
DAGNode.transformEdges(com.google.common.base.Function<? super DAGEdge<V,E>,? extends DAGEdge<V,E>> function)
Transform the edges in this graph.
|
DAGNode<V,E> |
DAGNode.transformEdges(com.google.common.base.Function<? super DAGEdge<V,E>,? extends DAGEdge<V,E>> function)
Transform the edges in this graph.
|
Modifier and Type | Method and Description |
---|---|
com.google.common.collect.SetMultimap<DAGNode<Component,Dependency>,DAGEdge<Component,Dependency>> |
DependencySolver.getBackEdges()
Get the map of back-edges for circular dependencies.
|
Copyright © 2016 GroupLens Research. All rights reserved.