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 |
Modifier and Type | Interface and Description |
---|---|
interface |
IdDag<Id>
A dag containing ids.
|
interface |
IdTree<Id>
A tree containing ids.
|
Modifier and Type | Class and Description |
---|---|
class |
IdDagClass<Id>
An implementation of IdDag.
|
class |
IdGraphClass<Id>
An implementation of IdGraph.
|
class |
IdTreeClass<Id>
An implementation of IdTree.
|
Modifier and Type | Method and Description |
---|---|
IdGraph<Id> |
IdGraphClass.ancestorIdGraph(Id id,
boolean inclusive) |
IdGraph<Id> |
IdGraph.ancestorIdGraph(Id id,
boolean inclusive)
Getting an id's ancestor id graph (its, parents' parents, and so on).
|
IdGraph<Id> |
IdGraphClass.ancestorIdGraph(Set<Id> ids,
boolean inclusive) |
IdGraph<Id> |
IdGraph.ancestorIdGraph(Set<Id> ids,
boolean inclusive)
Getting an id set's ancestor id graph (their parents, parents' parents, and so on).
|
IdGraph<Id> |
IdGraphClass.descendantIdGraph(Id id,
boolean inclusive) |
IdGraph<Id> |
IdGraph.descendantIdGraph(Id id,
boolean inclusive)
Getting an id's descendant id graph (its children, childrens' children, and so on).
|
IdGraph<Id> |
IdGraphClass.descendantIdGraph(Set<Id> ids,
boolean inclusive) |
IdGraph<Id> |
IdGraph.descendantIdGraph(Set<Id> ids,
boolean inclusive)
Getting an id set's descendant id graph (their children, childrens' children, and so on).
|
IdGraph<Id> |
IdGraphClass.filterIdGraph(Set<Id> ids) |
IdGraph<Id> |
IdGraph.filterIdGraph(Set<Id> ids)
Filter a graph by only keep the specified ids and arcs between these ids.
|
static <Id> IdGraph<Id> |
IdGraphLib.fromChildMap(Id... alternatingIdsAndChildIds)
Create an IdGraph from a mapping from id to child ids (specified as alternating keys and values), assuming all ids are in that mapping.
|
static <Id> IdGraph<Id> |
IdGraphLib.fromChildMap(com.google.common.collect.Multimap<Id,Id> id__childIds)
Create an IdGraph from a mapping from id to child ids (specified as a multimap), assuming all ids are in that mapping.
|
static <Id> IdGraph<Id> |
IdGraphLib.fromChildMap(Set<Id> idSet,
Id... alternatingIdsAndChildIds)
Create an IdGraph from the graph's id set and a mapping from id to child ids (specified as alternating keys and values).
|
static <Id> IdGraph<Id> |
IdGraphLib.fromChildMap(Set<Id> idSet,
com.google.common.collect.Multimap<Id,Id> id__childIds)
Create an IdGraph from the graph's id set and a mapping from id to child ids (specified as a multimap).
|
static <Id> IdGraph<Id> |
IdGraphLib.fromParentMap(Id... alternatingIdsAndParentIds)
Create an IdGraph from a mapping from id to parent ids (specified as alternating keys and values), assuming all ids are in that mapping.
|
static <Id> IdGraph<Id> |
IdGraphLib.fromParentMap(com.google.common.collect.Multimap<Id,Id> id__parentIds)
Create an IdGraph from a mapping from id to parent ids (specified as a multimap), assuming all ids are in that mapping.
|
static <Id> IdGraph<Id> |
IdGraphLib.fromParentMap(Set<Id> idSet,
Id... alternatingIdsAndParentIds)
Create an IdGraph from the graph's id set and a mapping from id to parent ids (specified as alternating keys and values).
|
static <Id> IdGraph<Id> |
IdGraphLib.fromParentMap(Set<Id> idSet,
com.google.common.collect.Multimap<Id,Id> id__parentIds)
Create an IdGraph from the graph's id set and a mapping from id to parent ids (specified as a multimap).
|
Modifier and Type | Method and Description |
---|---|
static <Id,Node extends DownNode<Id>> |
DownNodeLib.nodes__idGraph(Iterable<Node> nodes)
Create an IdGraph from a DownNode iterable.
|
static <Id,Node extends UpNode<Id>> |
UpNodeLib.nodes__idGraph(Iterable<Node> nodes)
Create an IdGraph from an UpNode iterable.
|
Modifier and Type | Interface and Description |
---|---|
interface |
Dag<Id,Node>
A dag containing nodes.
|
interface |
Graph<Id,Node>
A digraph containing nodes.
|
interface |
Tree<Id,Node>
A tree containing nodes.
|
Modifier and Type | Class and Description |
---|---|
class |
DagClass<Id,Node>
An implementation of Dag.
|
class |
GraphClass<Id,Node>
An implementation of Graph.
|
class |
TreeClass<Id,Node>
An implementation of Tree.
|
Modifier and Type | Method and Description |
---|---|
IdGraph<Id> |
GraphClass.ancestorIdGraph(Id id,
boolean inclusive) |
IdGraph<Id> |
GraphClass.ancestorIdGraph(Set<Id> ids,
boolean inclusive) |
IdGraph<Id> |
GraphClass.descendantIdGraph(Id id,
boolean inclusive) |
IdGraph<Id> |
GraphClass.descendantIdGraph(Set<Id> ids,
boolean inclusive) |
IdGraph<Id> |
GraphClass.filterIdGraph(Set<Id> ids) |
IdGraph<Id> |
GraphClass.idGraph() |
Modifier and Type | Method and Description |
---|---|
static <Id,Node> Graph<Id,Node> |
GraphLib.graph(IdGraph<Id> idGraph,
com.google.common.collect.ImmutableBiMap<Id,Node> id__node)
Create a Graph from the nested IdGraph (the arc structure) and the mapping between id and node.
|
Constructor and Description |
---|
GraphClass(IdGraph<Id> idGraph,
com.google.common.collect.ImmutableBiMap<Id,Node> id__node,
boolean allowPartial) |
Modifier and Type | Interface and Description |
---|---|
interface |
PartialDag<Id,Node>
A partial dag containing nodes.
|
interface |
PartialGraph<Id,Node>
A partial digraph containing nodes.
|
interface |
PartialTree<Id,Node>
A partial tree containing nodes.
|
Modifier and Type | Method and Description |
---|---|
IdGraph<Id> |
PartialGraph.idGraph()
The internal id graph.
|
Modifier and Type | Method and Description |
---|---|
static <Id,Node> PartialGraph<Id,Node> |
PartialGraphLib.graph(IdGraph<Id> idGraph,
com.google.common.collect.ImmutableBiMap<Id,Node> id__node)
Create a PartialGraph from the nested IdGraph (the arc structure) and the mapping between id and node.
|
Copyright © 2014. All rights reserved.