Uses of Interface
com.stevewedig.blog.digraph.id_graph.IdDag

Packages that use IdDag

Package	Description
com.stevewedig.blog.digraph.id_graph
com.stevewedig.blog.digraph.node
com.stevewedig.blog.digraph.node_graph
com.stevewedig.blog.digraph.node_graph_partial

Uses of IdDag in com.stevewedig.blog.digraph.id_graph

Subinterfaces of IdDag in com.stevewedig.blog.digraph.id_graph

Modifier and Type	Interface and Description
interface	IdTree<Id> A tree containing ids.

Classes in com.stevewedig.blog.digraph.id_graph that implement IdDag

Modifier and Type	Class and Description
class	IdDagClass<Id> An implementation of IdDag.
class	IdTreeClass<Id> An implementation of IdTree.

Methods in com.stevewedig.blog.digraph.id_graph that return IdDag

Modifier and Type	Method and Description
IdDag<Id>	IdDagClass.ancestorIdGraph(Id id, boolean inclusive)
IdDag<Id>	IdDag.ancestorIdGraph(Id id, boolean inclusive)
IdDag<Id>	IdDagClass.ancestorIdGraph(Set<Id> ids, boolean inclusive)
IdDag<Id>	IdDag.ancestorIdGraph(Set<Id> ids, boolean inclusive)
IdDag<Id>	IdDagClass.descendantIdGraph(Id id, boolean inclusive)
IdDag<Id>	IdDag.descendantIdGraph(Id id, boolean inclusive)
IdDag<Id>	IdDagClass.descendantIdGraph(Set<Id> ids, boolean inclusive)
IdDag<Id>	IdDag.descendantIdGraph(Set<Id> ids, boolean inclusive)
IdDag<Id>	IdDagClass.filterIdGraph(Set<Id> ids)
IdDag<Id>	IdDag.filterIdGraph(Set<Id> ids)
static <Id> IdDag<Id>	IdDagLib.fromChildMap(Id... alternatingIdsAndChildIds) Create an IdDag from a mapping from id to child ids (specified as alternating keys and values), assuming all ids are in that mapping.
static <Id> IdDag<Id>	IdDagLib.fromChildMap(com.google.common.collect.Multimap<Id,Id> id__childIds) Create an IdDag from a mapping from id to child ids (specified as a multimap), assuming all ids are in that mapping.
static <Id> IdDag<Id>	IdDagLib.fromChildMap(Set<Id> idSet, Id... alternatingIdsAndChildIds) Create an IdDag from the dag's id set and a mapping from id to child ids (specified as alternating keys and values).
static <Id> IdDag<Id>	IdDagLib.fromChildMap(Set<Id> idSet, com.google.common.collect.Multimap<Id,Id> id__childIds) Create an IdDag from the dag's id set and a mapping from id to child ids (specified as a multimap).
static <Id> IdDag<Id>	IdDagLib.fromParentMap(Id... alternatingIdsAndParentIds) Create an IdDag from a mapping from id to parent ids (specified as alternating keys and values), assuming all ids are in that mapping.
static <Id> IdDag<Id>	IdDagLib.fromParentMap(com.google.common.collect.Multimap<Id,Id> id__parentIds) Create an IdDag from a mapping from id to parent ids (specified as a multimap), assuming all ids are in that mapping.
static <Id> IdDag<Id>	IdDagLib.fromParentMap(Set<Id> idSet, Id... alternatingIdsAndParentIds) Create an IdDag from the dag's id set and a mapping from id to parent ids (specified as alternating keys and values).
static <Id> IdDag<Id>	IdDagLib.fromParentMap(Set<Id> idSet, com.google.common.collect.Multimap<Id,Id> id__parentIds) Create an IdDag from the dag's id set and a mapping from id to parent ids (specified as a multimap).

Uses of IdDag in com.stevewedig.blog.digraph.node

Methods in com.stevewedig.blog.digraph.node that return IdDag

Modifier and Type	Method and Description
static <Id,Node extends DownNode<Id>> IdDag<Id>	DownNodeLib.nodes__idDag(com.google.common.collect.ImmutableSet<Node> nodes) Create an IdDag from a DownNode iterable.
static <Id,Node extends UpNode<Id>> IdDag<Id>	UpNodeLib.nodes__idDag(com.google.common.collect.ImmutableSet<Node> nodes) Create an IdDag from an UpNode iterable.

Uses of IdDag in com.stevewedig.blog.digraph.node_graph

Subinterfaces of IdDag in com.stevewedig.blog.digraph.node_graph

Modifier and Type	Interface and Description
interface	Dag<Id,Node> A dag containing nodes.
interface	Tree<Id,Node> A tree containing nodes.

Classes in com.stevewedig.blog.digraph.node_graph that implement IdDag

Modifier and Type	Class and Description
class	DagClass<Id,Node> An implementation of Dag.
class	TreeClass<Id,Node> An implementation of Tree.

Methods in com.stevewedig.blog.digraph.node_graph that return IdDag

Modifier and Type	Method and Description
IdDag<Id>	DagClass.ancestorIdGraph(Id id, boolean inclusive)
IdDag<Id>	DagClass.ancestorIdGraph(Set<Id> ids, boolean inclusive)
IdDag<Id>	DagClass.descendantIdGraph(Id id, boolean inclusive)
IdDag<Id>	DagClass.descendantIdGraph(Set<Id> ids, boolean inclusive)
IdDag<Id>	DagClass.filterIdGraph(Set<Id> ids)
IdDag<Id>	DagClass.idGraph()

Methods in com.stevewedig.blog.digraph.node_graph with parameters of type IdDag

Modifier and Type	Method and Description
static <Id,Node> Dag<Id,Node>	DagLib.dag(IdDag<Id> idDag, com.google.common.collect.ImmutableBiMap<Id,Node> id__node) Create a Dag from the nested IdDag (the arc structure) and the mapping between id and node.

Constructors in com.stevewedig.blog.digraph.node_graph with parameters of type IdDag

Constructor and Description
DagClass(IdDag<Id> idDag, com.google.common.collect.ImmutableBiMap<Id,Node> id__node, boolean allowPartial)

Uses of IdDag in com.stevewedig.blog.digraph.node_graph_partial

Subinterfaces of IdDag in com.stevewedig.blog.digraph.node_graph_partial

Modifier and Type	Interface and Description
interface	PartialDag<Id,Node> A partial dag containing nodes.
interface	PartialTree<Id,Node> A partial tree containing nodes.

Methods in com.stevewedig.blog.digraph.node_graph_partial that return IdDag

Modifier and Type	Method and Description
IdDag<Id>	PartialDag.idGraph() The internal id dag.

Methods in com.stevewedig.blog.digraph.node_graph_partial with parameters of type IdDag

Modifier and Type	Method and Description
static <Id,Node> PartialDag<Id,Node>	PartialDagLib.dag(IdDag<Id> idDag, com.google.common.collect.ImmutableBiMap<Id,Node> id__node) Create a PartialDag from the nested IdDag (the arc structure) and the mapping between id and node.