public interface PartialTree<Id,Node> extends PartialDag<Id,Node>, IdTree<Id>
| Modifier and Type | Method and Description |
|---|---|
IdTree<Id> |
idGraph()
The internal id tree.
|
add, addAll, clear, containsNodeForId, getId, getNode, id__node, nodeSet, nodeSize, remove, removeAll, retainAll, transformIterable, transformIterator, transformList, transformOptional, transformSet, unboundIdSetcontains, containsAll, equals, hashCode, isEmpty, iterator, size, toArray, toArrayancestorIdGraph, ancestorIdGraph, ancestorIdList, depth, descendantIdTree, leastDeep, maxDepth, mostDeep, parentId, rootIdbreadthIdIterable, breadthIdList, depthIdIterable, depthIdList, descendantIdGraph, descendantIdGraph, filterIdGraph, topsortIdListancestorIdIterable, 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, traverseIdListIdTree<Id> idGraph()
idGraph in interface PartialDag<Id,Node>idGraph in interface PartialGraph<Id,Node>Copyright © 2014. All rights reserved.