Package edu.ucla.sspace.graph

Interface Summary

Interface	Description
DirectedEdge	An interface for representing a directed edge between two vertices.
DirectedGraph<E extends DirectedEdge>	An interface specification for interacting with directed graph objects.
DirectedTypedEdge<T>	An interface for directed edges in multigraphs.
DynamicGraph	A stub interface for Graph instances that encode time on their vertices and edges.
Edge	An interface for representing an undirected edge between two vertices.
EdgeSet<T extends Edge>	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.
Graph<E extends Edge>	An interface specification for interacting with Graph objects.
Multigraph<T,E extends TypedEdge<T>>	An interface specification for interacting with MultiGraph objects.
TemporalEdge	An interface for representing a edge in a DynamicGraph, where each edge is associated with a specific time.
TypedEdge<T>	An interface for edges in multigraphs.
WeightedDirectedEdge	An interface for representing a weigthed edge between two vertices.
WeightedDirectedTypedEdge<T>	An interface for weigthed, directed edges in multigraphs.
WeightedEdge	An interface for representing a weigthed edge between two vertices.
WeightedGraph<E extends WeightedEdge>	An interface specification for interacting with weighted Graph objects.
WeightedTypedEdge<T>	An interface for representing a weigthed edge between two vertices in a multigraph.

Class Summary

Class	Description
AbstractGraph<T extends Edge,S extends EdgeSet<T>>	A base class for many Graph implementations.
BetweennessCentrality	An implementation of Brandes (2001) "A Faster Algorithm for Betweenness Centrality" (available here) for computing the betweenness centrality for all the vertices in a graph.
ChineseWhispersClustering
DirectedMultigraph<T>	A directed multigraph implementation.
Fanmod	A complete re-implementation of the FANMOD tool for finding motifs in graphs.
Fanmod.FrequencyAndZScoreFilter
Fanmod.FrequencyFilter
Fanmod.Result	The result of computing a motif's distribution in the graph and null model
Fanmod.ZScoreFilter
GenericEdgeSet<T extends Edge>	An EdgeSet implementation that imposes no restrictions on the type of edges that may be contained within.
GenericGraph<T extends Edge>	A graph that imposes no restriction on the types of edges that may connect its vertices.
GraphAdaptor<T extends Edge>	An abstract adaptor class that wraps an existing Graph.
GraphIO	A collection of static utility methods for reading and writing graphs.
Graphs	A collection of static utility methods for interacting with Graph instances.
LabeledEdge
LabeledGraph<L,E extends Edge>	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).
SamplingSubgraphIterator<T extends Edge>	An implementation of the Randomized EnumerateSubgraphs (RAND-ESU) method from Wernicke (2006), which provides a unbiased random sampling of the size-k subgraphs of an input graph.
SimpleDirectedEdge	An implementation of DirectedEdge
SimpleDirectedTypedEdge<T>	An implementation of an edge that is both a DirectedEdge and a TypedEdge.
SimpleEdge	An implementation of an undirected Edge.
SimpleGraphIterator<T,E extends TypedEdge<T>>	An iterator over the different permutations of parallel edges within a multigraph that result in connected simple graphs of a specified size.
SimpleTypedEdge<T>	An implementation of a TypedEdge.
SimpleWeightedDirectedTypedEdge<T>	An implementation of a TypedEdge.
SimpleWeightedEdge	An implementation of an undirected WeightedEdge.
SimpleWeightedTypedEdge<T>	An implementation of a TypedEdge.
SparseDirectedEdgeSet	An EdgeSet implementation that stores DirectedEdge instances for a vertex.
SparseDirectedGraph	An implementation of DirectedGraph that uses a sparse backing representation.
SparseDirectedTypedEdgeSet<T>	An EdgeSet implementation that stores DirectedTypedEdge instances for a vertex.
SparseTypedEdgeSet<T>	An EdgeSet implementation that stores TypedEdge instances for a vertex.
SparseUndirectedEdgeSet	A EdgeSet implementation for holding Edge instances.
SparseUndirectedGraph	An undirected implementation of Graph that uses a sparse backing representation.
SparseWeightedDirectedEdgeSet	A set for containing WeightedEdge instances.
SparseWeightedDirectedTypedEdgeSet<T>	An EdgeSet implementation that stores DirectedEdge instances for a vertex.
SparseWeightedEdgeSet	A set for containing WeightedEdge instances.
SparseWeightedGraph	An implementation of DirectedGraph that uses a sparse backing representation.
SubgraphIterator<E extends Edge,G extends Graph<E>>	An implementation of the EnumerateSubgraphs (ESU) method from Wernicke (2006), which enumerates all possible k-vertex subgraphs of a given graph.
UndirectedMultigraph<T>	A directed multigraph implementation.
WeightedDirectedMultigraph<T>	A weighted, directed Multigraph implementation.
WeightedLinkClustering

Enum Summary

Enum	Description
GraphIO.GraphFileFormat
GraphIO.GraphType

Exception Summary

Exception	Description
GraphConstructionException	An exception for cases where a change to a graph has resulted in an invalid construction according to its design contract.