com.stevewedig.blog.digraph.id_graph

Interface IdDag<Id>

All Superinterfaces:

IdGraph<Id>

All Known Subinterfaces:

Dag<Id,Node>, IdTree<Id>, PartialDag<Id,Node>, PartialTree<Id,Node>, Tree<Id,Node>

All Known Implementing Classes:

DagClass, IdDagClass, IdTreeClass, TreeClass

public interface IdDag<Id>
extends IdGraph<Id>

A dag containing ids.

Method Summary

Methods

Modifier and Type	Method and Description
IdDag<Id>	ancestorIdGraph(Id id, boolean inclusive) Getting an id's ancestor id graph (its, parents' parents, and so on).
IdDag<Id>	ancestorIdGraph(Set<Id> ids, boolean inclusive) Getting an id set's ancestor id graph (their parents, parents' parents, and so on).
Iterable<Id>	breadthIdIterable() A breadth first id iterable.
com.google.common.collect.ImmutableList<Id>	breadthIdList() A breadth first id list.
Iterable<Id>	depthIdIterable() A depth first id iterable.
com.google.common.collect.ImmutableList<Id>	depthIdList() A depth first id list.
IdDag<Id>	descendantIdGraph(Id id, boolean inclusive) Getting an id's descendant id graph (its children, childrens' children, and so on).
IdDag<Id>	descendantIdGraph(Set<Id> ids, boolean inclusive) Getting an id set's descendant id graph (their children, childrens' children, and so on).
IdDag<Id>	filterIdGraph(Set<Id> ids) Filter a graph by only keep the specified ids and arcs between these ids.
com.google.common.collect.ImmutableList<Id>	topsortIdList() A topologically sorted list of ids, with roots (sources) first.

Methods inherited from interface com.stevewedig.blog.digraph.id_graph.IdGraph

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

Method Detail

filterIdGraph

IdDag<Id> filterIdGraph(Set<Id> ids)

Description copied from interface: IdGraph

Filter a graph by only keep the specified ids and arcs between these ids.

Specified by:

filterIdGraph in interface IdGraph<Id>

ancestorIdGraph

IdDag<Id> ancestorIdGraph(Id id,
                        boolean inclusive)

Description copied from interface: IdGraph

Getting an id's ancestor id graph (its, parents' parents, and so on).

Specified by:

ancestorIdGraph in interface IdGraph<Id>

ancestorIdGraph

IdDag<Id> ancestorIdGraph(Set<Id> ids,
                        boolean inclusive)

Description copied from interface: IdGraph

Getting an id set's ancestor id graph (their parents, parents' parents, and so on).

Specified by:

ancestorIdGraph in interface IdGraph<Id>

descendantIdGraph

IdDag<Id> descendantIdGraph(Id id,
                          boolean inclusive)

Description copied from interface: IdGraph

Getting an id's descendant id graph (its children, childrens' children, and so on).

Specified by:

descendantIdGraph in interface IdGraph<Id>

descendantIdGraph

IdDag<Id> descendantIdGraph(Set<Id> ids,
                          boolean inclusive)

Description copied from interface: IdGraph

Getting an id set's descendant id graph (their children, childrens' children, and so on).

Specified by:

descendantIdGraph in interface IdGraph<Id>

topsortIdList

com.google.common.collect.ImmutableList<Id> topsortIdList()

A topologically sorted list of ids, with roots (sources) first.

depthIdIterable

Iterable<Id> depthIdIterable()

A depth first id iterable.

depthIdList

com.google.common.collect.ImmutableList<Id> depthIdList()

A depth first id list.

breadthIdIterable

Iterable<Id> breadthIdIterable()

A breadth first id iterable.

breadthIdList

com.google.common.collect.ImmutableList<Id> breadthIdList()

A breadth first id list.