Package | Description |
---|---|
com.stevewedig.blog.digraph.node_graph | |
com.stevewedig.blog.digraph.node_graph_partial |
Modifier and Type | Interface and Description |
---|---|
interface |
Tree<Id,Node>
A tree containing nodes.
|
Modifier and Type | Class and Description |
---|---|
class |
TreeClass<Id,Node>
An implementation of Tree.
|
Modifier and Type | Method and Description |
---|---|
static <Id,Node extends DownNode<Id>> |
PartialTreeLib.down(com.google.common.collect.ImmutableSet<Node> nodeSet)
Create a PartialTree from an DownNode set.
|
static <Id,Node extends DownNode<Id>> |
PartialTreeLib.down(Iterable<Node> nodeIterable)
Create a PartialTree from an DownNode iterable.
|
static <Id,Node extends DownNode<Id>> |
PartialTreeLib.down(Node... nodeArray)
Create a PartialTree from an DownNode array.
|
static <Id,Node extends DownNode<Id>> |
PartialTreeLib.down(Set<Node>... trees)
Create a PartialTree from the union of multiple DownNode sets (remember that PartialTree<Node>
extends Set<Node>).
|
static <Id,Node> PartialTree<Id,Node> |
PartialTreeLib.tree(IdTree<Id> idTree,
com.google.common.collect.ImmutableBiMap<Id,Node> id__node)
Create a PartialTree from the nested IdTree (the arc structure) and the mapping between id and node.
|
static <Id,Node extends UpNode<Id>> |
PartialTreeLib.up(com.google.common.collect.ImmutableSet<Node> nodeSet)
Create a PartialTree from an UpNode set.
|
static <Id,Node extends UpNode<Id>> |
PartialTreeLib.up(Iterable<Node> nodeIterable)
Create a PartialTree from an UpNode iterable.
|
static <Id,Node extends UpNode<Id>> |
PartialTreeLib.up(Node... nodeArray)
Create a PartialTree from an UpNode array.
|
static <Id,Node extends UpNode<Id>> |
PartialTreeLib.up(Set<Node>... trees)
Create a PartialTree from the union of multiple UpNode sets (remember that PartialTree<Node> extends
Set<Node>).
|
Copyright © 2014. All rights reserved.