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)
Get a provider that, when invoked, will return an instance of the component represented
by a graph.
|
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 |
---|---|
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 |
---|---|
DAGNode<V,E> |
DAGNodeBuilder.build() |
DAGNode<V,E> |
DAGNode.findNodeBFS(com.google.common.base.Predicate<? super DAGNode<V,E>> pred)
Do a breadth-first search for a node.
|
DAGNode<V,E> |
DAGEdge.getHead()
Get the edge's head (starting node).
|
DAGNode<V,E> |
DAGEdge.getTail()
Get the edge's tail (ending node).
|
DAGNode<V,E> |
MergePool.merge(DAGNode<V,E> graph)
Merge and simplify a graph.
|
DAGNode<V,E> |
DAGNode.replaceNode(DAGNode<V,E> node,
DAGNode<V,E> replacement,
Map<DAGNode<V,E>,DAGNode<V,E>> memory)
Replace one node with another in this graph.
|
static <V,E> DAGNode<V,E> |
DAGNode.singleton(V label)
Create a new DAG node with no outgoing edges.
|
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 |
---|---|
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<DAGNode<V,E>> |
DAGNode.getAdjacentNodes()
Get the nodes that are adjacent to this node (only considering outgoing edges).
|
Set<org.apache.commons.lang3.tuple.Pair<DAGNode<V,E>,E>> |
DAGNodeBuilder.getEdges()
Get the set of edges.
|
Set<DAGNode<V,E>> |
DAGNode.getReachableNodes() |
List<DAGNode<V,E>> |
DAGNode.getSortedNodes()
Topographical sort all nodes reachable from the given root node.
|
static <V> com.google.common.base.Predicate<DAGNode<V,?>> |
DAGNode.labelMatches(com.google.common.base.Predicate<? super V> pred) |
Modifier and Type | Method and Description |
---|---|
DAGNodeBuilder<V,E> |
DAGNodeBuilder.addEdge(DAGNode<V,E> target,
E label)
Add an edge.
|
static <V,E> DAGNodeBuilder<V,E> |
DAGNode.copyBuilder(DAGNode<V,E> node)
Create a new builder initialized to build a copy of the specified node.
|
static <V,E> DAGEdge<V,E> |
DAGEdge.create(DAGNode<V,E> head,
DAGNode<V,E> tail,
E label) |
static <V,E> DAGEdge<V,E> |
DAGEdge.create(DAGNode<V,E> head,
DAGNode<V,E> tail,
E label) |
Set<DAGEdge<V,E>> |
DAGNode.getIncomingEdges(DAGNode<V,E> node)
Get the incoming edges to a node reachable from this node.
|
DAGEdge<V,E> |
DAGNode.getOutgoingEdge(DAGNode<V,E> target,
E label)
Get the outgoing edge with the specified target and label, if it exists.
|
DAGNode<V,E> |
MergePool.merge(DAGNode<V,E> graph)
Merge and simplify a graph.
|
DAGNode<V,E> |
DAGNode.replaceNode(DAGNode<V,E> node,
DAGNode<V,E> replacement,
Map<DAGNode<V,E>,DAGNode<V,E>> memory)
Replace one node with another in this graph.
|
DAGNode<V,E> |
DAGNode.replaceNode(DAGNode<V,E> node,
DAGNode<V,E> replacement,
Map<DAGNode<V,E>,DAGNode<V,E>> memory)
Replace one node with another in this graph.
|
Modifier and Type | Method and Description |
---|---|
DAGNodeBuilder<V,E> |
DAGNodeBuilder.addEdge(org.apache.commons.lang3.tuple.Pair<DAGNode<V,E>,E> edge)
Add an edge.
|
DAGNode<V,E> |
DAGNode.findNodeBFS(com.google.common.base.Predicate<? super DAGNode<V,E>> pred)
Do a breadth-first search for a node.
|
static <V,E> com.google.common.base.Predicate<DAGEdge<V,E>> |
DAGEdge.headMatches(com.google.common.base.Predicate<? super DAGNode<V,E>> pred) |
DAGNode<V,E> |
DAGNode.replaceNode(DAGNode<V,E> node,
DAGNode<V,E> replacement,
Map<DAGNode<V,E>,DAGNode<V,E>> memory)
Replace one node with another in this graph.
|
DAGNode<V,E> |
DAGNode.replaceNode(DAGNode<V,E> node,
DAGNode<V,E> replacement,
Map<DAGNode<V,E>,DAGNode<V,E>> memory)
Replace one node with another in this graph.
|
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 |
---|---|
DAGNode<Component,Dependency> |
DependencySolver.getBackEdge(DAGNode<Component,Dependency> parent,
Desire desire)
Get the back edge for a particular node and desire, if one exists.
|
DAGNode<Component,Dependency> |
DependencySolver.getGraph()
Get the current full dependency graph.
|
DAGNode<Component,Dependency> |
DependencySolver.getRootNode()
Deprecated.
Use
DependencySolver.getGraph() instead. |
DAGNode<Component,Dependency> |
DependencySolver.rewrite(DAGNode<Component,Dependency> graph)
Rewrite a dependency graph using the rules in this solver.
|
static DAGNode<Component,Dependency> |
DependencySolver.rootNode()
Get a singleton root node for a dependency 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.
|
Modifier and Type | Method and Description |
---|---|
DAGNode<Component,Dependency> |
DependencySolver.getBackEdge(DAGNode<Component,Dependency> parent,
Desire desire)
Get the back edge for a particular node and desire, if one exists.
|
DAGNode<Component,Dependency> |
DependencySolver.rewrite(DAGNode<Component,Dependency> graph)
Rewrite a dependency graph using the rules in this solver.
|
Copyright © 2016 GroupLens Research. All rights reserved.