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

Packages that use DirectedEdge

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

Uses of DirectedEdge in edu.ucla.sspace.graph

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

Modifier and Type	Interface and Description
interface	DirectedGraph<E extends DirectedEdge> An interface specification for interacting with directed graph objects.

Subinterfaces of DirectedEdge in edu.ucla.sspace.graph

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

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

Modifier and Type	Class and Description
class	SimpleDirectedEdge An implementation of DirectedEdge
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 with type parameters of type DirectedEdge

Modifier and Type	Method and Description
static <E extends DirectedEdge> DirectedGraph<E>	Graphs.asDirectedGraph(Graph<E> g)

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

Modifier and Type	Method and Description
DirectedGraph<DirectedEdge>	SparseDirectedGraph.copy(Set<Integer> vertices) Creates a copy of this graph containing only the specified number of vertices and all edges between those vertices.
Set<DirectedEdge>	SparseDirectedEdgeSet.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<DirectedEdge>	SparseDirectedEdgeSet.inEdges() Returns the set of DirectedEdge instances that point to the root vertex.
Set<DirectedEdge>	SparseDirectedGraph.inEdges(int vertex) Returns the set of directed edges where vertex is the head of the edge
Iterator<DirectedEdge>	SparseDirectedEdgeSet.iterator()
Set<DirectedEdge>	SparseDirectedEdgeSet.outEdges() Returns the set of DirectedEdge instances that originate from the root vertex.
Set<DirectedEdge>	SparseDirectedGraph.outEdges(int vertex) Returns the set of directed edges where vertex is the tail of the edge, i.e.
static DirectedGraph<DirectedEdge>	GraphIO.readDirected(File f)
static DirectedGraph<DirectedEdge>	GraphIO.readDirected(File f, Indexer<String> vertexIndexer)

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

Modifier and Type	Method and Description
boolean	SparseDirectedEdgeSet.add(DirectedEdge 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.

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

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

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

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

Modifier and Type	Method and Description
<E extends DirectedEdge> void	DotIO.writeDirectedGraph(DirectedGraph<E> g, File f)

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

Modifier and Type	Method and Description
DirectedGraph<DirectedEdge>	GraphReaderAdapter.readDirected(File f) Reads in the directed graph from the provided file
DirectedGraph<DirectedEdge>	GraphReader.readDirected(File f) Reads in the directed graph from the provided file
DirectedGraph<DirectedEdge>	EdgeListReader.readDirected(File f)
DirectedGraph<DirectedEdge>	GraphReaderAdapter.readDirected(File f, Indexer<String> vertexLabels) Reads in the directed graph from the provided file, using the specified Indexer to decide how vertex labels in the file are mapped to numeric vertices.
DirectedGraph<DirectedEdge>	GraphReader.readDirected(File f, Indexer<String> vertexLabels) Reads in the directed graph from the provided file, using the specified Indexer to decide how vertex labels in the file are mapped to numeric vertices.
DirectedGraph<DirectedEdge>	EdgeListReader.readDirected(File f, Indexer<String> vertexIndexer)
DirectedGraph<DirectedEdge>	DotIO.readDirectedGraph(File dotFile)
static Graph<DirectedEdge>	PajekIO.readPajek(File f)

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

Modifier and Type	Method and Description
void	DotWriter.write(DirectedGraph<? extends DirectedEdge> g, File f)
void	DotWriter.write(DirectedGraph<? extends DirectedEdge> g, File f, Collection<Set<Integer>> groups)