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

Packages that use WeightedDirectedTypedEdge

Package	Description
edu.ucla.sspace.graph

Uses of WeightedDirectedTypedEdge in edu.ucla.sspace.graph

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

Modifier and Type	Class and Description
class	SimpleWeightedDirectedTypedEdge<T> An implementation of a TypedEdge.

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

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

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

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

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