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

Packages that use TypedEdge

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

Uses of TypedEdge in edu.ucla.sspace.graph

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

Modifier and Type	Interface and Description
interface	Multigraph<T,E extends TypedEdge<T>> An interface specification for interacting with MultiGraph objects.
class	SimpleGraphIterator<T,E extends TypedEdge<T>> An iterator over the different permutations of parallel edges within a multigraph that result in connected simple graphs of a specified size.

Subinterfaces of TypedEdge in edu.ucla.sspace.graph

Modifier and Type	Interface and Description
interface	DirectedTypedEdge<T> An interface for directed edges in multigraphs.
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 TypedEdge

Modifier and Type	Class and Description
class	SimpleDirectedTypedEdge<T> An implementation of an edge that is both a DirectedEdge and a TypedEdge.
class	SimpleTypedEdge<T> An implementation of a TypedEdge.
class	SimpleWeightedDirectedTypedEdge<T> An implementation of a TypedEdge.
class	SimpleWeightedTypedEdge<T> An implementation of a TypedEdge.

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

Modifier and Type	Method and Description
static <T,E extends TypedEdge<T>> Multigraph<T,E>	Graphs.asMultigraph(Graph<E> g)
<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.

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

Modifier and Type	Method and Description
Set<TypedEdge<T>>	UndirectedMultigraph.edges() Returns the set of typed edges in the graph
Set<TypedEdge<T>>	UndirectedMultigraph.edges(T t) Returns the set of edges with the corresponding type or the empty set if no edges of that exist.
Set<TypedEdge<T>>	UndirectedMultigraph.getAdjacencyList(int vertex) Returns the set of typed edges connected to the vertex.
Set<TypedEdge<T>>	SparseTypedEdgeSet.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.
Set<TypedEdge<T>>	UndirectedMultigraph.getEdges(int vertex1, int vertex2) Returns the set of TypedEdge instances that connect the two vertices.
Set<TypedEdge<T>>	UndirectedMultigraph.getEdges(int vertex1, int vertex2, Set<T> types)
Set<TypedEdge<T>>	SparseTypedEdgeSet.getEdges(int vertex, Set<T> types)
Set<TypedEdge<T>>	SparseTypedEdgeSet.getEdges(T type)
Iterator<TypedEdge<T>>	SparseTypedEdgeSet.iterator()
Iterator<TypedEdge<T>>	SparseTypedEdgeSet.uniqueIterator()

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

Modifier and Type	Method and Description
boolean	SparseTypedEdgeSet.add(TypedEdge<T> 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	UndirectedMultigraph.add(TypedEdge<T> e) Adds an edge between the two vertices, returning true if the edge was not previously present (optional operation).
boolean	UndirectedMultigraph.remove(TypedEdge<T> edge) 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 TypedEdge

Modifier and Type	Method and Description
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)

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

Constructor and Description
UndirectedMultigraph(Graph<? extends TypedEdge<T>> g) Creates a directed multigraph with a copy of all the vertices and edges in g.

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

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

Modifier and Type	Method and Description
<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 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

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

Modifier and Type	Method and Description
<T> void	DotWriter.write(Multigraph<T,? extends TypedEdge<T>> g, File f)

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

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

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 TypedEdge

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.