V
 The type of node (vertex) labels.E
 The type of edge labels.@Immutable public class DAGNode<V,E> extends Object implements Serializable
Nodes and edges may not have null labels. There may be multiple edges from one node to another, so long as those edges have distinct labels.
Nodes know about all nodes reachable from them, and the edges connecting those nodes.
DAGs and their nodes are immutable. You can build them using a builder,
obtained from newBuilder(Object)
.
Modifier and Type  Method and Description 

static <V,E> DAGNodeBuilder<V,E> 
copyBuilder(DAGNode<V,E> node)
Create a new builder initialized to build a copy of the specified node.

DAGEdge<V,E> 
findEdgeBFS(com.google.common.base.Predicate<? super DAGEdge<V,E>> pred)
Do a breadthfirst search for an edge.

DAGNode<V,E> 
findNodeBFS(com.google.common.base.Predicate<? super DAGNode<V,E>> pred)
Do a breadthfirst search for a node.

Set<DAGNode<V,E>> 
getAdjacentNodes()
Get the nodes that are adjacent to this node (only considering outgoing edges).

Set<DAGEdge<V,E>> 
getIncomingEdges(DAGNode<V,E> node)
Get the incoming edges to a node reachable from this node.

V 
getLabel()
Get the label for this node.

DAGEdge<V,E> 
getOutgoingEdge(DAGNode<V,E> target,
E label)
Get the outgoing edge with the specified target and label, if it exists.

Set<DAGEdge<V,E>> 
getOutgoingEdges()
Get the outgoing edges of this node.

DAGEdge<V,E> 
getOutgoingEdgeWithLabel(E label)
Get an outgoing edge from this node with the specified label, if it exists.

DAGEdge<V,E> 
getOutgoingEdgeWithLabel(com.google.common.base.Predicate<? super E> predicate)
Search for an outgoing edge by a predicate.

Set<DAGNode<V,E>> 
getReachableNodes() 
List<DAGNode<V,E>> 
getSortedNodes()
Topographical sort all nodes reachable from the given root node.

static <V> com.google.common.base.Predicate<DAGNode<V,?>> 
labelMatches(com.google.common.base.Predicate<? super V> pred) 
static <V,E> DAGNodeBuilder<V,E> 
newBuilder()
Construct a new DAG node builder.

static <V,E> DAGNodeBuilder<V,E> 
newBuilder(V label)
Construct a new DAG node builder.

DAGNode<V,E> 
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> 
singleton(V label)
Create a new DAG node with no outgoing edges.

String 
toString() 
DAGNode<V,E> 
transformEdges(com.google.common.base.Function<? super DAGEdge<V,E>,? extends DAGEdge<V,E>> function)
Transform the edges in this graph.

public static <V,E> DAGNode<V,E> singleton(V label)
V
 The type of node labels.E
 The type of edge labels.label
 The node label.public static <V,E> DAGNodeBuilder<V,E> newBuilder()
V
 The type of node labels.E
 The type of edge labels.public static <V,E> DAGNodeBuilder<V,E> newBuilder(V label)
V
 The type of node labels.E
 The type of edge labels.label
 The node label.public static <V,E> DAGNodeBuilder<V,E> copyBuilder(DAGNode<V,E> node)
V
 The type of node labels.E
 The type of edge labels.node
 The node to copy.node
.@Nonnull public Set<DAGEdge<V,E>> getOutgoingEdges()
public DAGEdge<V,E> getOutgoingEdge(DAGNode<V,E> target, E label)
target
 The target node.label
 The label.target
with label label
, if it exists, or
null
if no such edge exists.public DAGEdge<V,E> getOutgoingEdgeWithLabel(E label)
label
 The label.null
if no such edge exists.
If multiple edges have this label, an arbitrary one is returned.public DAGEdge<V,E> getOutgoingEdgeWithLabel(com.google.common.base.Predicate<? super E> predicate)
predicate
 A predicate over labels.null
if no such edge exists. If
multiple edges have labels matching the predicate, it is undefined which one will be
added.public Set<DAGNode<V,E>> getAdjacentNodes()
@Nonnull public List<DAGNode<V,E>> getSortedNodes()
Nodes in the graph that are not connected to the root will not appear in the returned list.
@Nonnull public Set<DAGEdge<V,E>> getIncomingEdges(DAGNode<V,E> node)
public DAGNode<V,E> replaceNode(DAGNode<V,E> node, DAGNode<V,E> replacement, Map<DAGNode<V,E>,DAGNode<V,E>> memory)
node
are replaced
with edges referencing replacement
.node
 The node to replace.replacement
 The replacement node.memory
 A table to remember node replacements. It maintains a mapping of every node
that has to be replaced with the node that replaces it. This map should
usually be empty on the initial call to this method. In particular, it should
not contain any reachable nodes on the initial call, or unexpected behavior
may arise. Recursive calls of this method to itself do contain such nodes.public DAGNode<V,E> findNodeBFS(@Nonnull com.google.common.base.Predicate<? super DAGNode<V,E>> pred)
pred
 The predicate for matching nodes.pred
in a breadthfirst search, or null
if no
such node is found.public DAGEdge<V,E> findEdgeBFS(@Nonnull com.google.common.base.Predicate<? super DAGEdge<V,E>> pred)
pred
 The predicate for matching nodes.pred
in a breadthfirst search, or null
if no
such node is found.public DAGNode<V,E> transformEdges(com.google.common.base.Function<? super DAGEdge<V,E>,? extends DAGEdge<V,E>> function)
function
 The edge transformation function. Any edge returned by this function must
have the same head node as the function it was passed. The transform
function may need to replace the head node on a returned edge; the label and
tail will be preserved. If the function returns null
, that is the
same as returning its input unmodified.public static <V> com.google.common.base.Predicate<DAGNode<V,?>> labelMatches(com.google.common.base.Predicate<? super V> pred)
Copyright © 2016 GroupLens Research. All rights reserved.