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

Packages that use WeightedGraph

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

Uses of WeightedGraph in edu.ucla.sspace.graph

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

Modifier and Type	Class and Description
class	SparseWeightedGraph An implementation of DirectedGraph that uses a sparse backing representation.
class	WeightedDirectedMultigraph<T> A weighted, directed Multigraph implementation.

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

Modifier and Type	Method and Description
static <E extends WeightedEdge> WeightedGraph<E>	Graphs.asWeightedGraph(Graph<E> g)
WeightedGraph<WeightedEdge>	SparseWeightedGraph.copy(Set<Integer> toCopy) Creates a copy of this graph containing only the specified number of vertices and all edges between those vertices.
WeightedGraph<E>	WeightedGraph.copy(Set<Integer> vertices) Creates a copy of this graph containing only the specified number of vertices and all edges between those vertices.
static WeightedGraph<WeightedEdge>	GraphIO.readWeighted(File f)
static WeightedGraph<WeightedEdge>	GraphIO.readWeighted(File f, Indexer<String> vertexIndexer)
static WeightedGraph<WeightedEdge>	GraphIO.readWeighted(File f, Indexer<String> vertexIndexer, double minWeight)
WeightedGraph	SparseWeightedGraph.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).
WeightedGraph<E>	WeightedGraph.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).

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

Modifier and Type	Method and Description
<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.
static void	GraphIO.writeWeighted(File f, WeightedGraph<? extends WeightedEdge> g)
static void	GraphIO.writeWeighted(File f, WeightedGraph<? extends WeightedEdge> g, Indexer<String> vertexLabels)

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

Methods in edu.ucla.sspace.graph.io that return WeightedGraph

Modifier and Type	Method and Description
WeightedGraph<WeightedEdge>	GraphReaderAdapter.readWeighted(File f) Reads in the weighted graph from the provided file.
WeightedGraph<WeightedEdge>	GraphReader.readWeighted(File f) Reads in the weighted graph from the provided file.
WeightedGraph<WeightedEdge>	EdgeListReader.readWeighted(File f)
WeightedGraph<WeightedEdge>	GraphReaderAdapter.readWeighted(File f, Indexer<String> vertexLabels) Reads in the weighted graph from the provided file, using the specified Indexer to decide how vertex labels in the file are mapped to numeric vertices.
WeightedGraph<WeightedEdge>	GraphReader.readWeighted(File f, Indexer<String> vertexLabels) Reads in the weighted graph from the provided file, using the specified Indexer to decide how vertex labels in the file are mapped to numeric vertices.
WeightedGraph<WeightedEdge>	EdgeListReader.readWeighted(File f, Indexer<String> vertexIndexer)
WeightedGraph<WeightedEdge>	GraphReaderAdapter.readWeighted(File f, Indexer<String> vertexLabels, double minWeight) Reads in the graph from the provided file, using the specified Indexer to decide how vertex labels in the file are mapped to numeric vertices, and keeping only those weights above the specified value.
WeightedGraph<WeightedEdge>	GraphReader.readWeighted(File f, Indexer<String> vertexLabels, double minWeight) Reads in the graph from the provided file, using the specified Indexer to decide how vertex labels in the file are mapped to numeric vertices, and keeping only those weights above the specified value.
WeightedGraph<WeightedEdge>	EdgeListReader.readWeighted(File f, Indexer<String> vertexIndexer, double minWeight)

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

Modifier and Type	Method and Description
void	GexfIO.write(WeightedGraph<? extends WeightedEdge> g, File gexfFile) Writes the WeightedGraph to file in gexf format.
void	GexfIO.write(WeightedGraph<? extends WeightedEdge> g, File gexfFile, Indexer<String> vertexLabels) Writes the WeightedGraph to file in gexf format.