Uses of Interface
com.stevewedig.blog.digraph.node_graph.Graph

Packages that use Graph

Package	Description
com.stevewedig.blog.digraph.node_graph

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

Subinterfaces of Graph 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 Graph

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.

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

Modifier and Type	Method and Description
static <Id,Node extends DownNode<Id>> Graph<Id,Node>	GraphLib.down(com.google.common.collect.ImmutableSet<Node> nodeSet) Create a Graph from an DownNode set.
static <Id,Node extends DownNode<Id>> Graph<Id,Node>	GraphLib.down(Iterable<Node> nodeIterable) Create a Graph from an DownNode iterable.
static <Id,Node extends DownNode<Id>> Graph<Id,Node>	GraphLib.down(Node... nodeArray) Create a Graph from an DownNode array.
static <Id,Node extends DownNode<Id>> Graph<Id,Node>	GraphLib.down(Set<Node>... graphs) Create a Graph from the union of multiple DownNode sets (remember that Graph<Node> extends Set<Node>).
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.
static <Id,Node extends UpNode<Id>> Graph<Id,Node>	GraphLib.up(com.google.common.collect.ImmutableSet<Node> nodeSet) Create a Graph from an UpNode set.
static <Id,Node extends UpNode<Id>> Graph<Id,Node>	GraphLib.up(Iterable<Node> nodeIterable) Create a Graph from an UpNode iterable.
static <Id,Node extends UpNode<Id>> Graph<Id,Node>	GraphLib.up(Node... nodeArray) Create a Graph from an UpNode array.
static <Id,Node extends UpNode<Id>> Graph<Id,Node>	GraphLib.up(Set<Node>... graphs) Create a Graph from the union of multiple UpNode sets (remember that Graph<Node> extends Set<Node>).