| Package | Description |
|---|---|
| gov.sandia.cognition.graph | |
| gov.sandia.cognition.graph.community | |
| gov.sandia.cognition.graph.inference |
| Class and Description |
|---|
| DenseMemoryGraph
Most basic-est of graph types.
|
| DirectedNodeEdgeGraph
This interface defines the minimal set of methods necessary to create and
walk a directed graph.
|
| DirectedWeightedNodeEdgeGraph
Adds the necessary methods for a graph with weighted edges.
|
| GraphMetrics
This class is intended to allow programmers to get any number of graph
metrics for any input graph without bloating the intentionally spartan graph
implementations and interfaces.
|
| GraphWalker.NextNodeSelector
This interface defines the method needed by the GraphWalker class to
implement all features of graph walking _except_ the algorithm used to
select the next node to visit
|
| WeightedDenseMemoryGraph
Implementation for a weighted graph type
|
| Class and Description |
|---|
| DirectedNodeEdgeGraph
This interface defines the minimal set of methods necessary to create and
walk a directed graph.
|
| GraphMetrics
This class is intended to allow programmers to get any number of graph
metrics for any input graph without bloating the intentionally spartan graph
implementations and interfaces.
|
| Class and Description |
|---|
| DirectedNodeEdgeGraph
This interface defines the minimal set of methods necessary to create and
walk a directed graph.
|