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

Packages that use DirectedTypedEdge

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

Uses of DirectedTypedEdge in edu.ucla.sspace.graph

Subinterfaces of DirectedTypedEdge in edu.ucla.sspace.graph

Modifier and Type	Interface and Description
interface	WeightedDirectedTypedEdge<T> An interface for weigthed, directed edges in multigraphs.

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

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

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

Modifier and Type	Method and Description
Set<DirectedTypedEdge<T>>	DirectedMultigraph.edges() Returns the set of typed edges in the graph
Set<DirectedTypedEdge<T>>	DirectedMultigraph.edges(T t) Returns the set of edges with the corresponding type or the empty set if no edges of that exist.
Set<DirectedTypedEdge<T>>	DirectedMultigraph.getAdjacencyList(int vertex) Returns the set of typed edges connected to the vertex.
Set<DirectedTypedEdge<T>>	SparseDirectedTypedEdgeSet.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<DirectedTypedEdge<T>>	DirectedMultigraph.getEdges(int vertex1, int vertex2) Returns the set of TypedEdge instances that connect the two vertices.
Set<DirectedTypedEdge<T>>	DirectedMultigraph.getEdges(int vertex1, int vertex2, Set<T> types)
Set<DirectedTypedEdge<T>>	SparseDirectedTypedEdgeSet.getEdges(int vertex, Set<T> types)
Set<DirectedTypedEdge<T>>	SparseDirectedTypedEdgeSet.getEdges(T type)
Set<DirectedTypedEdge<T>>	SparseDirectedTypedEdgeSet.incoming() Returns the set of edges that point to the vertex associated with this edge set.
Set<DirectedTypedEdge<T>>	DirectedMultigraph.inEdges(int vertex) Returns the set of directed edges where vertex is the head of the edge
Iterator<DirectedTypedEdge<T>>	SparseDirectedTypedEdgeSet.iterator()
Set<DirectedTypedEdge<T>>	DirectedMultigraph.outEdges(int vertex) Returns the set of directed edges where vertex is the tail of the edge, i.e.
Set<DirectedTypedEdge<T>>	SparseDirectedTypedEdgeSet.outgoing() Returns the set of edges that originate from the vertex associated with this edge set.
Iterator<DirectedTypedEdge<T>>	SparseDirectedTypedEdgeSet.uniqueIterator()

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

Modifier and Type	Method and Description
boolean	SparseDirectedTypedEdgeSet.add(DirectedTypedEdge<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	DirectedMultigraph.add(DirectedTypedEdge<T> e) Adds an edge between the two vertices, returning true if the edge was not previously present (optional operation).
boolean	DirectedMultigraph.remove(DirectedTypedEdge<T> edge) Removes the edge from vertex1 to vertex2, returning true if the edge existed and was removed (optional operation).

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

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

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

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

Modifier and Type	Method and Description
<T,E extends DirectedTypedEdge<T>> void	DotIO.writeDirectedMultigraph(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 DirectedTypedEdge<T>> void	DotIO.writeDirectedMultigraph(Multigraph<T,E> g, File f, Map<T,Color> edgeColors)