public interface Graph<N extends HasContentId> extends HasCidScheme, ToContentAddressable<CaGraph<N>>
Modifier and Type  Method and Description 

SomeEdges<N> 
getEdges() 
SomeContent<N> 
getExplicitNodes()
Explicit nodes are nodes that are independent of being
referenced by edges; this means that if you remove an edge that
references an explicit node, both getNodes() and getExplicitNodes() will
still return that explicit node.

SomeContent<N> 
getNodes()
Every node referred to by an edge as a known or discoverable, and every
node explicitly added to the graph must be returned.

CaGraph<N> 
toCa()
return a content addressable graph representation of this graph (or
whatever state is available  just document your caveats)

Traversal<N> 
traverse()
begin traversal with edges that have no knowns.

Traversal<N> 
traverse(N node)
begin traversal of the graph with the given node as known

getCidScheme
SomeContent<N> getNodes()
SomeContent<N> getExplicitNodes()
EdgeIndex.EdgeIndexBuilder.addNode(HasContentId)
, and will not
add nodes to the explicit nodes when they are added to the graph because
of an edge with a method like EdgeIndex.EdgeIndexBuilder.add(MultiEdge)
.CaGraph<N> toCa()
toCa
in interface ToContentAddressable<CaGraph<N extends HasContentId>>
Traversal<N> traverse(N node)
node
 Traversal<N> traverse()