Package | Description |
---|---|
edu.ucla.sspace.graph | |
edu.ucla.sspace.graph.io | |
edu.ucla.sspace.graph.isomorphism |
Class and Description |
---|
AbstractGraph
A base class for many
Graph implementations. |
DirectedEdge
An interface for representing a directed edge between
two vertices.
|
DirectedGraph
An interface specification for interacting with directed graph
objects.
|
DirectedMultigraph
A directed multigraph implementation.
|
DirectedTypedEdge
An interface for directed edges in multigraphs.
|
Edge
An interface for representing an undirected edge between two vertices.
|
EdgeSet
A subinterface of
Set that provides an abstraction over the set of
edges that are connected to a single vertex. |
Fanmod.MotifFilter
An interface for performing some computation on a subgraph's frequency
information to deicide whether its occurrences constitute it being a
motif.
|
Fanmod.Result
The result of computing a motif's distribution in the graph and null
model
|
GenericEdgeSet
An
EdgeSet implementation that imposes no restrictions on the type of
edges that may be contained within. |
Graph
An interface specification for interacting with Graph objects.
|
GraphAdaptor
An abstract adaptor class that wraps an existing
Graph . |
GraphIO.GraphFileFormat |
GraphIO.GraphType |
LabeledGraph
A decorator around all graph types that allows vertices to take on arbitrary
labels.
|
LinkClustering
An implmentation of the link clustering described in Ahn, Bagrow, and Lehman
(2010).
|
Multigraph
An interface specification for interacting with MultiGraph objects.
|
SparseDirectedEdgeSet
An
EdgeSet implementation that stores DirectedEdge instances
for a vertex. |
SparseDirectedTypedEdgeSet
An
EdgeSet implementation that stores DirectedTypedEdge
instances for a vertex. |
SparseTypedEdgeSet |
SparseUndirectedEdgeSet |
SparseWeightedDirectedTypedEdgeSet
An
EdgeSet implementation that stores DirectedEdge instances
for a vertex. |
SparseWeightedEdgeSet
A set for containing
WeightedEdge instances. |
TemporalEdge
An interface for representing a edge in a
DynamicGraph , where each
edge is associated with a specific time. |
TypedEdge
An interface for edges in multigraphs.
|
UndirectedMultigraph
A directed multigraph implementation.
|
WeightedDirectedEdge
An interface for representing a weigthed edge between two vertices.
|
WeightedDirectedMultigraph |
WeightedDirectedTypedEdge
An interface for weigthed, directed edges in multigraphs.
|
WeightedEdge
An interface for representing a weigthed edge between two vertices.
|
WeightedGraph
An interface specification for interacting with weighted Graph objects.
|
WeightedTypedEdge
An interface for representing a weigthed edge between two vertices in a
multigraph.
|
Class and Description |
---|
DirectedEdge
An interface for representing a directed edge between
two vertices.
|
DirectedGraph
An interface specification for interacting with directed graph
objects.
|
DirectedMultigraph
A directed multigraph implementation.
|
DirectedTypedEdge
An interface for directed edges in multigraphs.
|
Edge
An interface for representing an undirected edge between two vertices.
|
Graph
An interface specification for interacting with Graph objects.
|
Multigraph
An interface specification for interacting with MultiGraph objects.
|
TypedEdge
An interface for edges in multigraphs.
|
UndirectedMultigraph
A directed multigraph implementation.
|
WeightedDirectedMultigraph |
WeightedEdge
An interface for representing a weigthed edge between two vertices.
|
WeightedGraph
An interface specification for interacting with weighted Graph objects.
|
Class and Description |
---|
Edge
An interface for representing an undirected edge between two vertices.
|
Graph
An interface specification for interacting with Graph objects.
|
Multigraph
An interface specification for interacting with MultiGraph objects.
|
TypedEdge
An interface for edges in multigraphs.
|
Copyright © 2012. All Rights Reserved.