Uses of Interface
edu.ucla.sspace.graph.Multigraph

Packages that use Multigraph

Package	Description
edu.ucla.sspace.graph
edu.ucla.sspace.graph.io
edu.ucla.sspace.graph.isomorphism

Uses of Multigraph in edu.ucla.sspace.graph

Classes in edu.ucla.sspace.graph that implement Multigraph

Modifier and Type	Class and Description
class	DirectedMultigraph<T> A directed multigraph implementation.
class	UndirectedMultigraph<T> A directed multigraph implementation.
class	WeightedDirectedMultigraph<T> A weighted, directed Multigraph implementation.

Methods in edu.ucla.sspace.graph that return Multigraph

Modifier and Type	Method and Description
static <T,E extends TypedEdge<T>> Multigraph<T,E>	Graphs.asMultigraph(Graph<E> g)
Multigraph<T,E>	Multigraph.copy(Set<Integer> vertices) Creates a copy of this graph containing only the specified number of vertices and all edges between those vertices.
Multigraph<T,E>	SimpleGraphIterator.next() Returns the next simple graph from the multigraph.
Multigraph<T,E>	Multigraph.subgraph(Set<Integer> vertices) Returns a view of this graph containing only the specified vertices where the returned graph's vertinces are renamed (0, ..., n).
Multigraph<T,E>	Multigraph.subgraph(Set<Integer> vertices, Set<T> edgeTypes) Returns a subgraph of this graph containing only the specified vertices and edges of the specified types.

Methods in edu.ucla.sspace.graph that return types with arguments of type Multigraph

Modifier and Type	Method and Description
<T,E extends TypedEdge<T>> Map<Multigraph<T,E>,Fanmod.Result>	Fanmod.findMotifs(Multigraph<T,E> g, boolean findSimpleMotifs, int motifSize, int numRandomGraphs, Fanmod.MotifFilter filter) Finds motifs in the input graph according to the specified parameters.

Methods in edu.ucla.sspace.graph with parameters of type Multigraph

Modifier and Type	Method and Description
<T,E extends TypedEdge<T>> Map<Multigraph<T,E>,Fanmod.Result>	Fanmod.findMotifs(Multigraph<T,E> g, boolean findSimpleMotifs, int motifSize, int numRandomGraphs, Fanmod.MotifFilter filter) Finds motifs in the input graph according to the specified parameters.
static <T,E extends TypedEdge<T>> int	Graphs.shufflePreserveType(Multigraph<T,E> g, int shufflesPerEdge) Shuffles the edges of g while still preserving the degree sequence of the graph and that edges are only swapped with those of the same type.
static <T,E extends TypedEdge<T>> int	Graphs.shufflePreserveType(Multigraph<T,E> g, int shufflesPerEdge, Random rnd) Shuffles the edges of g while still preserving the degree sequence of the graph and that edges are only swapped with those of the same type.
static <T> void	GraphIO.writeUndirectedMultigraph(Multigraph<T,TypedEdge<T>> g, File f)
static <T> void	GraphIO.writeUndirectedMultigraph(Multigraph<T,TypedEdge<T>> g, File f, Indexer<String> vertexLabels)

Constructors in edu.ucla.sspace.graph with parameters of type Multigraph

Constructor and Description
SimpleGraphIterator(Multigraph<T,E> g, int subgraphSize) Constructs an iterator over all the subgraphs of g with the specified subgraph size.

Uses of Multigraph in edu.ucla.sspace.graph.io

Methods in edu.ucla.sspace.graph.io with parameters of type Multigraph

Modifier and Type	Method and Description
<T> void	DotWriter.write(Multigraph<T,? extends TypedEdge<T>> g, File f)
<T,E extends TypedEdge<T>> void	GexfIO.write(Multigraph<T,E> g, File f) Writes the provided multigraph to the specified gexf file with all edge colors appearing the same.
<T,E extends TypedEdge<T>> void	GexfIO.write(Multigraph<T,E> g, File f, Indexer<String> vertexLabels) Writes the provided multigraph to the specified gexf file, using vertexLabels to name the vertices.
<T,E extends TypedEdge<T>> void	GexfIO.write(Multigraph<T,E> g, File f, Map<T,Color> edgeColors) Writes the provided multigraph to the specified gexf file, using edgeColors as a guide for how to display parallel edges of different types.
<T,E extends TypedEdge<T>> void	GexfIO.write(Multigraph<T,E> g, File f, Map<T,Color> edgeColors, Indexer<String> vertexLabels) Writes the provided multigraph to the specified gexf file, using edgeColors as a guide for how to display parallel edges of different types, and vertexLabels to name the vertices.
<T,E extends DirectedTypedEdge<T>> void	DotIO.writeDirectedMultigraph(Multigraph<T,E> g, File f) Writes the provided multigraph to the specified DOT file, using random colors to visualize each edge type.
<T,E extends DirectedTypedEdge<T>> void	DotIO.writeDirectedMultigraph(Multigraph<T,E> g, File f, Map<T,Color> edgeColors)
<T,E extends TypedEdge<T>> void	DotIO.writeUndirectedMultigraph(Multigraph<T,E> g, File f) Writes the provided multigraph to the specified DOT file, using random colors to visualize each edge type.
<T,E extends TypedEdge<T>> void	DotIO.writeUndirectedMultigraph(Multigraph<T,E> g, File f, Map<T,Color> edgeColors) Writes the provided multigraph to the specified DOT file, using edgeColors as a guide for how to display parallel edges of different types.
<T,E extends TypedEdge<T>> void	DotIO.writeUndirectedMultigraph(Multigraph<T,E> g, File f, Map<T,Color> edgeColors, Indexer<String> vertexLabels) Writes the provided multigraph to the specified DOT file, using edgeColors as a guide for how to display parallel edges of different types.
<T,E extends TypedEdge<T>> void	DotIO.writeUndirectedMultigraph(Multigraph<T,E> g, File f, Map<T,Color> edgeColors, MultiMap<Integer,String> vertexMetadata) The internal method that writes the undirect multigraph according to all various visualation configuration properties

Uses of Multigraph in edu.ucla.sspace.graph.isomorphism

Classes in edu.ucla.sspace.graph.isomorphism with type parameters of type Multigraph

Modifier and Type	Class and Description
class	TypedIsomorphicGraphCounter<T,G extends Multigraph<T,? extends TypedEdge<T>>> A special-purpose Counter that counts multigraphs based on typed isomorphism, rather than object equivalence (which may take into account vertex labeling, etc.).
class	TypedIsomorphicGraphIndexer<T,G extends Multigraph<T,? extends TypedEdge<T>>> An indexer that records only indices for non-isomorphic Multigraph instances.

Methods in edu.ucla.sspace.graph.isomorphism with type parameters of type Multigraph

Modifier and Type	Method and Description
static <T,G extends Multigraph<T,? extends TypedEdge<T>>> TypedIsomorphicGraphCounter<T,G>	TypedIsomorphicGraphCounter.asMotifs(Set<? extends G> motifs) Creates a new TypedIsomorphicGraphCounter that counts only the specified motifs.