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

Packages that use WeightedEdge

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

Uses of WeightedEdge in edu.ucla.sspace.graph

Classes in edu.ucla.sspace.graph with type parameters of type WeightedEdge

Modifier and Type	Interface and Description
interface	WeightedGraph<E extends WeightedEdge> An interface specification for interacting with weighted Graph objects.

Subinterfaces of WeightedEdge in edu.ucla.sspace.graph

Modifier and Type	Interface and Description
interface	WeightedDirectedEdge An interface for representing a weigthed edge between two vertices.
interface	WeightedDirectedTypedEdge<T> An interface for weigthed, directed edges in multigraphs.
interface	WeightedTypedEdge<T> An interface for representing a weigthed edge between two vertices in a multigraph.

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

Modifier and Type	Class and Description
class	SimpleWeightedDirectedTypedEdge<T> An implementation of a TypedEdge.
class	SimpleWeightedEdge An implementation of an undirected WeightedEdge.
class	SimpleWeightedTypedEdge<T> An implementation of a TypedEdge.

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

Modifier and Type	Method and Description
static <E extends WeightedEdge> WeightedGraph<E>	Graphs.asWeightedGraph(Graph<E> g)
<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.

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

Modifier and Type	Method and Description
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.
Set<WeightedEdge>	SparseWeightedEdgeSet.getEdges(int vertex) Returns the set of Edge instances that connect the root vertex with this vertex or an empty set if no such edges exist.
Iterator<WeightedEdge>	SparseWeightedEdgeSet.iterator()
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)

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

Modifier and Type	Method and Description
boolean	SparseWeightedEdgeSet.add(WeightedEdge e) Adds the edge to this set if one of the vertices is the root vertex.

Method parameters in edu.ucla.sspace.graph with type arguments of type WeightedEdge

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

Constructor parameters in edu.ucla.sspace.graph with type arguments of type WeightedEdge

Constructor and Description
SparseWeightedGraph(Graph<? extends WeightedEdge> g) Creates a directed graph with a copy of all the vertices and edges in g.

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

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

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)

Method parameters in edu.ucla.sspace.graph.io with type arguments of type WeightedEdge

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.