public interface Tree<Id,Node> extends Dag<Id,Node>, PartialTree<Id,Node>
Modifier and Type | Method and Description |
---|---|
com.google.common.collect.ImmutableList<Node> |
ancestorNodeList(Id id,
boolean inclusive)
Getting an id's ancestor node list, with the root node first and the id's parent node last.
|
com.google.common.base.Optional<Node> |
parentNode(Id id)
Getting an id's parent node, will be absent if the id is the root.
|
Node |
rootNode()
The tree's root node.
|
breadthNodeIterable, breadthNodeList, depthNodeIterable, depthNodeList, topsortNodeList
ancestorNodeIterable, ancestorNodeIterable, ancestorNodeSet, ancestorNodeSet, childNodeSet, descendantNodeIterable, descendantNodeIterable, descendantNodeSet, descendantNodeSet, leafNodeSet, optionalTopsortNodeList, parentNodeSet, rootNodeSet, transformIterable, transformIterator, transformList, transformOptional, transformSet, traverseNodeIterable, traverseNodeIterable, traverseNodeList, traverseNodeList
idGraph
add, addAll, clear, containsNodeForId, getId, getNode, id__node, nodeSet, nodeSize, remove, removeAll, retainAll, transformIterable, transformIterator, transformList, transformOptional, transformSet, unboundIdSet
contains, containsAll, equals, hashCode, isEmpty, iterator, size, toArray, toArray
ancestorIdGraph, ancestorIdGraph, ancestorIdList, depth, descendantIdTree, leastDeep, maxDepth, mostDeep, parentId, rootId
breadthIdIterable, breadthIdList, depthIdIterable, depthIdList, descendantIdGraph, descendantIdGraph, filterIdGraph, topsortIdList
ancestorIdIterable, ancestorIdIterable, ancestorIdSet, ancestorIdSet, assertIdsEqual, assertIdsEqual, childIdSet, containsCycle, descendantIdIterable, descendantIdIterable, descendantIdSet, descendantIdSet, id__childIds, id__parentIds, idSet, idSize, isAncestorOf, isChildOf, isDescendantOf, isLeaf, isParentOf, isRoot, leafIdSet, optionalTopsortIdList, parentIdSet, rootIdSet, traverseIdIterable, traverseIdIterable, traverseIdList, traverseIdList
Copyright © 2014. All rights reserved.