lib.easyjava.graph.directed

Class DirectedVertex<T>

java.lang.Object

lib.easyjava.graph.GraphComponent

lib.easyjava.graph.Vertex<T>

lib.easyjava.graph.directed.DirectedVertex<T>

Type Parameters:

T - the type of the data the vertex stores

All Implemented Interfaces:

java.io.Serializable

Direct Known Subclasses:

UnweightedDirectedVertex, WeightedDirectedVertex

public abstract class DirectedVertex<T>
extends Vertex<T>

An vertex of a directed graph which stores some data

Author:

Rob Rua (robrua@alumni.cmu.edu)

See Also:

Serialized Form

Method Summary

Modifier and Type	Method and Description
java.util.Set<DirectedVertex<T>>	getAdjacentVertices() Gets all the vertices adjacent to this one.
java.util.Set<DirectedEdge<T>>	getEdges() Gets all the edges connected to this vertex.
java.util.Set<DirectedVertex<T>>	getIncomingAdjacentVertices() Gets all the vertices which have edges to this vertex
java.util.Set<DirectedEdge<T>>	getIncomingEdges() Gets all the edges which go to this vertex
java.util.Set<DirectedVertex<T>>	getOutgoingAdjacentVertices() Gets all the vertices that this has an edge to
java.util.Set<DirectedEdge<T>>	getOutgoingEdges() Gets all the edges which leave from this vertex
void	removeAllEdges() Removes all the edges connected to this vertex from the graph
void	removeAllIncomingEdges() Deletes all edges which go into this vertex from the graph
void	removeAllOutgoingEdges() Deletes all edges which come out of the vertex from the graph
void	removeFromGraph() Removes this component from the graph it is a part of.

Methods inherited from class lib.easyjava.graph.Vertex

getData, setData, toString

Methods inherited from class lib.easyjava.graph.GraphComponent

fromGraph, fromSameGraphAs

Methods inherited from class java.lang.Object

equals, getClass, hashCode, notify, notifyAll, wait, wait, wait

Method Detail

getAdjacentVertices

public java.util.Set<DirectedVertex<T>> getAdjacentVertices()

Description copied from class: Vertex

Gets all the vertices adjacent to this one. In directed graphs, this includes both ingoing and outgoing connections.

Specified by:

getAdjacentVertices in class Vertex<T>

Returns:

the adjacent vertices

getEdges

public java.util.Set<DirectedEdge<T>> getEdges()

Description copied from class: Vertex

Gets all the edges connected to this vertex. In directed graphs, this includes both ingoing and outgoing edges.

Specified by:

getEdges in class Vertex<T>

Returns:

the connected edges

getIncomingAdjacentVertices

public java.util.Set<DirectedVertex<T>> getIncomingAdjacentVertices()

Gets all the vertices which have edges to this vertex

Returns:

the incoming neighbors

getIncomingEdges

public java.util.Set<DirectedEdge<T>> getIncomingEdges()

Gets all the edges which go to this vertex

Returns:

the incoming edges

getOutgoingAdjacentVertices

public java.util.Set<DirectedVertex<T>> getOutgoingAdjacentVertices()

Gets all the vertices that this has an edge to

Returns:

the outgoing neighbors

getOutgoingEdges

public java.util.Set<DirectedEdge<T>> getOutgoingEdges()

Gets all the edges which leave from this vertex

Returns:

the outgoing edges

removeAllEdges

public void removeAllEdges()

Description copied from class: Vertex

Removes all the edges connected to this vertex from the graph

Specified by:

removeAllEdges in class Vertex<T>

removeAllIncomingEdges

public void removeAllIncomingEdges()

Deletes all edges which go into this vertex from the graph

removeAllOutgoingEdges

public void removeAllOutgoingEdges()

Deletes all edges which come out of the vertex from the graph

removeFromGraph

public void removeFromGraph()

Description copied from class: GraphComponent

Removes this component from the graph it is a part of. When extending this class this method will probably need to be overridden and called with super;

Overrides:

removeFromGraph in class GraphComponent