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

Packages that use Edge

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

Uses of Edge in edu.ucla.sspace.graph

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

Modifier and Type	Class and Description
class	AbstractGraph<T extends Edge,S extends EdgeSet<T>> A base class for many Graph implementations.
interface	EdgeSet<T extends Edge> A subinterface of Set that provides an abstraction over the set of edges that are connected to a single vertex.
class	GenericEdgeSet<T extends Edge> An EdgeSet implementation that imposes no restrictions on the type of edges that may be contained within.
class	GenericGraph<T extends Edge> A graph that imposes no restriction on the types of edges that may connect its vertices.
interface	Graph<E extends Edge> An interface specification for interacting with Graph objects.
class	GraphAdaptor<T extends Edge> An abstract adaptor class that wraps an existing Graph.
class	LabeledGraph<L,E extends Edge> A decorator around all graph types that allows vertices to take on arbitrary labels.
class	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.
class	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.

Subinterfaces of Edge in edu.ucla.sspace.graph

Modifier and Type	Interface and Description
interface	DirectedEdge An interface for representing a directed edge between two vertices.
interface	DirectedTypedEdge<T> An interface for directed edges in multigraphs.
interface	TemporalEdge An interface for representing a edge in a DynamicGraph, where each edge is associated with a specific time.
interface	TypedEdge<T> An interface for edges in multigraphs.
interface	WeightedDirectedEdge An interface for representing a weigthed edge between two vertices.
interface	WeightedDirectedTypedEdge<T> An interface for weigthed, directed edges in multigraphs.
interface	WeightedEdge An interface for representing a weigthed edge between two vertices.
interface	WeightedTypedEdge<T> An interface for representing a weigthed edge between two vertices in a multigraph.

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

Modifier and Type	Class and Description
class	LabeledEdge
class	SimpleDirectedEdge An implementation of DirectedEdge
class	SimpleDirectedTypedEdge<T> An implementation of an edge that is both a DirectedEdge and a TypedEdge.
class	SimpleEdge An implementation of an undirected Edge.
class	SimpleTypedEdge<T> An implementation of a TypedEdge.
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 Edge

Modifier and Type	Method and Description
<E extends Edge> E	SimpleWeightedTypedEdge.clone(int from, int to) Clones the contents associated with this edge, returning the copy mapped to the provided vertices.
<E extends Edge> E	SimpleDirectedTypedEdge.clone(int from, int to) Clones the contents associated with this edge, returning the copy mapped to the provided vertices.
<E extends Edge> E	SimpleWeightedDirectedTypedEdge.clone(int from, int to) Clones the contents associated with this edge, returning the copy mapped to the provided vertices.
<E extends Edge> E	SimpleTypedEdge.clone(int from, int to) Clones the contents associated with this edge, returning the copy mapped to the provided vertices.
<T extends Edge> T	LabeledEdge.clone(int from, int to)
<T extends Edge> T	Edge.clone(int from, int to) Clones the contents associated with this edge, returning the copy mapped to the provided vertices.
<T extends Edge> T	SimpleDirectedEdge.clone(int from, int to) Clones the contents associated with this edge, returning the copy mapped to the provided vertices.
<T extends Edge> T	SimpleEdge.clone(int from, int to) Clones the contents associated with this edge, returning the copy mapped to the provided vertices.
<T extends Edge> T	SimpleWeightedEdge.clone(int from, int to) Clones the contents associated with this edge, returning the copy mapped to the provided vertices.
<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 Edge> double[]	BetweennessCentrality.compute(Graph<E> g) Returns a mapping from each vertex to its betweenness centrality measure.
<E extends Edge> Map<Graph<E>,Fanmod.Result>	Fanmod.findMotifs(Graph<E> g, int motifSize, int numRandomGraphs, Fanmod.MotifFilter filter) Finds motifs in the input graph according to the specified parameters.
<E extends Edge> E	SimpleWeightedTypedEdge.flip() Returns a copy of this edge with the from and to vertices swapped.
<E extends Edge> E	SimpleDirectedTypedEdge.flip() Returns a copy of this edge with the from and to vertices swapped.
<E extends Edge> E	SimpleWeightedDirectedTypedEdge.flip() Returns a copy of this edge with the from and to vertices swapped.
<E extends Edge> E	SimpleTypedEdge.flip() Returns a copy of this edge with the from and to vertices swapped.
<T extends Edge> T	LabeledEdge.flip()
<T extends Edge> T	Edge.flip() Returns a copy of this edge with the from and to vertices swapped.
<T extends Edge> T	SimpleEdge.flip() Returns a copy of this edge with the from and to vertices swapped.
<T extends Edge> T	SimpleWeightedEdge.flip() Returns a copy of this edge with the from and to vertices swapped.
<U extends Edge> U	SimpleDirectedEdge.flip() Returns a copy of this edge with the from and to vertices swapped.
protected <E extends Edge> double	WeightedLinkClustering.getConnectionSimilarity(Graph<E> graph, int keystone, int impost1, int impost2)
protected <E extends Edge> double	LinkClustering.getConnectionSimilarity(Graph<E> graph, int keystone, int impost1, int impost2) Computes the similarity of the two edges as the Jaccard index of the neighbors of two impost nodes.
static <E extends Edge> Graph<E>	Graphs.pack(Graph<E> g) Creates a copy of the provided graph where all vertices are remapped to a contiguous range from 0 to g.order()-1.
static <E extends Edge> int	Graphs.shufflePreserve(Graph<E> g, int shufflesPerEdge) Shuffles the edges of g while still preserving the degree sequence of the graph.
static <E extends Edge> int	Graphs.shufflePreserve(Graph<E> g, int shufflesPerEdge, Random rnd) Shuffles the edges of g while still preserving the degree sequence of the graph.
static <T extends Edge> Graph<T>	Graphs.synchronizedGraph(Graph<T> g) To-do
static <E extends Edge,G extends Graph<E>> Graph<Edge>	Graphs.toLineGraph(G graph) Converts the provided graph into a line graph, where each edge is mapped to a vertex and edges that share vertices are connected by an edge in the line graph.
static <E extends Edge,G extends Graph<E>> Graph<Edge>	Graphs.toLineGraph(G graph, Indexer<E> edgeIndices) Converts the provided graph into a line graph, where each edge is mapped to a vertex and edges that share vertices are connected by an edge in the line graph, using edgeIndices to specify the mapping between edges in the input graph and their corresponding vertices in the line graph.
static <T extends Edge> Graph<T>	Graphs.unmodifiable(Graph<T> g) To-do

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

Modifier and Type	Method and Description
Graph<Edge>	SparseUndirectedGraph.copy(Set<Integer> vertices) Creates a copy of this graph containing only the specified number of vertices and all edges between those vertices.
Set<Edge>	SparseUndirectedEdgeSet.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<Edge>	SparseUndirectedEdgeSet.iterator()
static Graph<? extends Edge>	GraphIO.read(File f, GraphIO.GraphType type)
static Graph<Edge>	GraphIO.readUndirected(File f)
static Graph<Edge>	GraphIO.readUndirected(File f, Indexer<String> vertexIndexer)
static Graph<Edge>	GraphIO.readUndirectedFromWeighted(File f, Indexer<String> vertexIndexer, double minWeight) Reads in an undirected network from a file containing weighted edges, only keeping those undirected edges whose weight was above the specified threshold
static <E extends Edge,G extends Graph<E>> Graph<Edge>	Graphs.toLineGraph(G graph) Converts the provided graph into a line graph, where each edge is mapped to a vertex and edges that share vertices are connected by an edge in the line graph.
static <E extends Edge,G extends Graph<E>> Graph<Edge>	Graphs.toLineGraph(G graph, Indexer<E> edgeIndices) Converts the provided graph into a line graph, where each edge is mapped to a vertex and edges that share vertices are connected by an edge in the line graph, using edgeIndices to specify the mapping between edges in the input graph and their corresponding vertices in the line graph.

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

Modifier and Type	Method and Description
boolean	SparseUndirectedEdgeSet.add(Edge e) Adds the edge to this set if one of the vertices is the root vertex and if the non-root vertex has a greater index that this vertex.
boolean	DirectedMultigraph.contains(Edge e) Returns true if this graph contains an edge of the specific type between vertex1 and vertex2.
boolean	WeightedDirectedMultigraph.contains(Edge e) Returns true if this graph contains an edge of the specific type between vertex1 and vertex2.
boolean	UndirectedMultigraph.contains(Edge e) Returns true if this graph contains an edge of the specific type between vertex1 and vertex2.
boolean	AbstractGraph.contains(Edge e) Returns true if this graph contains an edge of the specific type between vertex1 and vertex2.
boolean	AbstractGraph.Subgraph.contains(Edge e) Returns true if this graph contains an edge of the specific type between vertex1 and vertex2.
boolean	Graph.contains(Edge e) Returns true if this graph contains an edge of the specific type between vertex1 and vertex2.
boolean	GraphAdaptor.contains(Edge e) Returns true if this graph contains an edge of the specific type between vertex1 and vertex2.
boolean	AbstractGraph.remove(Edge e) Removes the edge from vertex1 to vertex2, returning true if the edge existed and was removed (optional operation).
boolean	AbstractGraph.Subgraph.remove(Edge e) Removes the edge from vertex1 to vertex2, returning true if the edge existed and was removed (optional operation).

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

Modifier and Type	Method and Description
static void	GraphIO.writeUndirected(File f, Graph<? extends Edge> g, Indexer<String> vertexLabels)

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

Constructor and Description
SparseUndirectedGraph(Graph<? extends Edge> g) Creates an undirected graph with a copy of all the vertices and edges in g.

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

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

Modifier and Type	Method and Description
<E extends Edge> void	PajekIO.writeUndirectedGraph(Graph<E> g, File f)
<E extends Edge> void	DotIO.writeUndirectedGraph(Graph<E> g, File f)
<E extends Edge> void	DotIO.writeUndirectedGraph(Graph<E> g, File f, Indexer<String> vertexLabels)

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

Modifier and Type	Method and Description
Graph<Edge>	GraphReaderAdapter.readUndirected(File f) Reads in the graph from the provided file
Graph<Edge>	GraphReader.readUndirected(File f) Reads in the graph from the provided file
Graph<Edge>	EdgeListReader.readUndirected(File f)
Graph<Edge>	GraphReaderAdapter.readUndirected(File f, Indexer<String> vertexLabels) 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.
Graph<Edge>	GraphReader.readUndirected(File f, Indexer<String> vertexLabels) 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.
Graph<Edge>	EdgeListReader.readUndirected(File f, Indexer<String> vertexIndexer)
Graph<Edge>	GraphReaderAdapter.readUndirectedFromWeighted(File f, Indexer<String> vertexLabels, double minWeight) Reads in an undirected network from a file containing weighted edges, only keeping those undirected edges whose weight was above the specified threshold
Graph<Edge>	GraphReader.readUndirectedFromWeighted(File f, Indexer<String> vertexLabels, double minWeight) Reads in an undirected network from a file containing weighted edges, only keeping those undirected edges whose weight was above the specified threshold
Graph<Edge>	EdgeListReader.readUndirectedFromWeighted(File f, Indexer<String> vertexIndexer, double minWeight) Reads in an undirected network from a file containing weighted edges, only keeping those undirected edges whose weight was above the specified threshold

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

Modifier and Type	Method and Description
void	DotWriter.write(Graph<? extends Edge> g, File f)

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

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

Modifier and Type	Class and Description
class	IsomorphicGraphCounter<G extends Graph<? extends Edge>> A special-purpose Counter that counts graphs based on isomorphism, rather than object equivalence (which may take into account vertex labeling, etc.).
class	IsomorphicSet<G extends Graph<? extends Edge>> A Set of Graph instances that maintains the invariant that all graphs in the set are non-isomorphisms of each other.

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

Modifier and Type	Method and Description
Graph<? extends Edge>	VF2State.getGraph1() Returns the first graph being matched
Graph<? extends Edge>	State.getGraph1() Returns the first graph being matched
Graph<? extends Edge>	TypedVF2State.getGraph1() Returns the first graph being matched
Graph<? extends Edge>	VF2State.getGraph2() Returns the first graph being matched
Graph<? extends Edge>	State.getGraph2() Returns the first graph being matched
Graph<? extends Edge>	TypedVF2State.getGraph2() Returns the first graph being matched

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

Modifier and Type	Method and Description
boolean	IsomorphismTester.areIsomorphic(Graph<? extends Edge> g1, Graph<? extends Edge> g2) Returns true if the graphs are isomorphism of each other.
boolean	IsomorphismTester.areIsomorphic(Graph<? extends Edge> g1, Graph<? extends Edge> g2) Returns true if the graphs are isomorphism of each other.
boolean	AbstractIsomorphismTester.areIsomorphic(Graph<? extends Edge> g1, Graph<? extends Edge> g2) Returns true if the graphs are isomorphism of each other.
boolean	AbstractIsomorphismTester.areIsomorphic(Graph<? extends Edge> g1, Graph<? extends Edge> g2) Returns true if the graphs are isomorphism of each other.
Map<Integer,Integer>	IsomorphismTester.findIsomorphism(Graph<? extends Edge> g1, Graph<? extends Edge> g2) Returns an isomorphic mapping from the vertices in g1 to the vertices in g2, or an empty Map if no such mapping exists.
Map<Integer,Integer>	IsomorphismTester.findIsomorphism(Graph<? extends Edge> g1, Graph<? extends Edge> g2) Returns an isomorphic mapping from the vertices in g1 to the vertices in g2, or an empty Map if no such mapping exists.
Map<Integer,Integer>	AbstractIsomorphismTester.findIsomorphism(Graph<? extends Edge> g1, Graph<? extends Edge> g2) Returns an isomorphic mapping from the vertices in g1 to the vertices in g2, or an empty Map if no such mapping exists.
Map<Integer,Integer>	AbstractIsomorphismTester.findIsomorphism(Graph<? extends Edge> g1, Graph<? extends Edge> g2) Returns an isomorphic mapping from the vertices in g1 to the vertices in g2, or an empty Map if no such mapping exists.
protected State	VF2IsomorphismTester.makeInitialState(Graph<? extends Edge> g1, Graph<? extends Edge> g2) Returns a new State for running the VF2 algorithm.
protected State	VF2IsomorphismTester.makeInitialState(Graph<? extends Edge> g1, Graph<? extends Edge> g2) Returns a new State for running the VF2 algorithm.
protected abstract State	AbstractIsomorphismTester.makeInitialState(Graph<? extends Edge> g1, Graph<? extends Edge> g2) Creates an empty State for mapping the vertices of g1 to g2.
protected abstract State	AbstractIsomorphismTester.makeInitialState(Graph<? extends Edge> g1, Graph<? extends Edge> g2) Creates an empty State for mapping the vertices of g1 to g2.
protected State	TypedVF2IsomorphismTester.makeInitialState(Graph<? extends Edge> g1, Graph<? extends Edge> g2) Returns a new State for running the VF2 algorithm.
protected State	TypedVF2IsomorphismTester.makeInitialState(Graph<? extends Edge> g1, Graph<? extends Edge> g2) Returns a new State for running the VF2 algorithm.

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

Constructor and Description
TypedVF2State(Graph<? extends Edge> g1, Graph<? extends Edge> g2) Creates a new TypedVF2State with an empty mapping between the two graphs.
TypedVF2State(Graph<? extends Edge> g1, Graph<? extends Edge> g2) Creates a new TypedVF2State with an empty mapping between the two graphs.
VF2State(Graph<? extends Edge> g1, Graph<? extends Edge> g2) Creates a new VF2State with an empty mapping between the two graphs.
VF2State(Graph<? extends Edge> g1, Graph<? extends Edge> g2) Creates a new VF2State with an empty mapping between the two graphs.