Uses of Interface
edu.ucla.sspace.util.MultiMap

Packages that use MultiMap

Package	Description
edu.ucla.sspace.graph
edu.ucla.sspace.graph.io
edu.ucla.sspace.util
edu.ucla.sspace.util.primitive

Uses of MultiMap in edu.ucla.sspace.graph

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

Modifier and Type	Method and Description
<E extends Edge> MultiMap<Integer,Integer>	ChineseWhispersClustering.cluster(Graph<E> graph)
<E extends Edge> MultiMap<Integer,Integer>	ChineseWhispersClustering.cluster(Graph<E> graph, int maxIterations)
<E extends Edge> MultiMap<Integer,Integer>	ChineseWhispersClustering.cluster(Graph<E> graph, int maxIterations, double randomAssignmentProb)
<E extends Edge> MultiMap<Integer,Integer>	LinkClustering.cluster(Graph<E> graph, int numClusters, Properties props) Computes the similarity of the graph's edges and merges them until the specified number of clusters has been reached.
<E extends Edge> MultiMap<Integer,Integer>	LinkClustering.cluster(Graph<E> graph, Properties props) Computes the similarity of the graph's edges and merges them to select the final partitioning that maximizes the overall cluster density.
<E extends WeightedEdge> MultiMap<Integer,Integer>	WeightedLinkClustering.cluster(WeightedGraph<E> graph, int numClusters, Properties props) Computes the similarity of the graph's edges and merges them until the specified number of clusters has been reached.
<E extends WeightedEdge> MultiMap<Integer,Integer>	WeightedLinkClustering.cluster(WeightedGraph<E> graph, Properties props) Computes the similarity of the graph's edges using their weights and merges them to select the final partitioning that maximizes the overall cluster density.

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

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

Modifier and Type	Method and Description
<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 MultiMap in edu.ucla.sspace.util

Subinterfaces of MultiMap in edu.ucla.sspace.util

Modifier and Type	Interface and Description
interface	SortedMultiMap<K,V> A MultiMap that provides a total ordering for the keys.

Classes in edu.ucla.sspace.util that implement MultiMap

Modifier and Type	Class and Description
class	BoundedSortedMultiMap<K,V> A MultiMap implementation that grows to a fixed size and then retains only a fixed number of either keys or mappings.
class	HashMultiMap<K,V> A hash table based implementation of the MultiMap interface.
class	TreeMultiMap<K,V> A Red-Black tree SortedMultiMap implementation.

Methods in edu.ucla.sspace.util with parameters of type MultiMap

Modifier and Type	Method and Description
void	TreeMultiMap.putAll(MultiMap<? extends K,? extends V> m) Copies all of the mappings from the specified mulit-map to this mutli-map
void	HashMultiMap.putAll(MultiMap<? extends K,? extends V> m) Copies all of the mappings from the specified mulit-map to this mutli-map
void	MultiMap.putAll(MultiMap<? extends K,? extends V> m) Copies all of the mappings from the specified mulit-map to this mutli-map

Uses of MultiMap in edu.ucla.sspace.util.primitive

Subinterfaces of MultiMap in edu.ucla.sspace.util.primitive

Modifier and Type	Interface and Description
interface	IntIntMultiMap A MultiMap subinterface for mapping int primitives as both keys and values.

Classes in edu.ucla.sspace.util.primitive that implement MultiMap

Modifier and Type	Class and Description
class	IntIntHashMultiMap A MultiMap implementation for mapping int primitives as both keys and values using a hashing strategy.

Methods in edu.ucla.sspace.util.primitive with parameters of type MultiMap

Modifier and Type	Method and Description
void	IntIntHashMultiMap.putAll(MultiMap<? extends Integer,? extends Integer> m) Copies all of the mappings from the specified mulit-map to this mutli-map