All Packages Class Hierarchy This Package Previous Next Index
Class structure.GraphListDirected
java.lang.Object

+structure.GraphList

+structure.GraphListDirected
 public class GraphListDirected
 extends GraphList
A class implementing a directed, adjacencylist based graph.
 See Also:
 GraphList, GraphListUndirected, GraphMatrixDirected

GraphListDirected()
 Construct a directed, adjacencylist based graph.

addEdge(Object, Object, Object)
 Add an edge between two vertices within the graph.

edgeCount()
 Determine the number of edges in graph.

remove(Object)
 Remove a vertex from the graph.

removeEdge(Object, Object)
 Remove possible edge between vertices labeled vLabel1 and vLabel2.

toString()
 Construct a string representation of graph.
GraphListDirected
public GraphListDirected()
 Construct a directed, adjacencylist based graph.
 Postcondition:
 constructs an directed graph
addEdge
public void addEdge(Object vLabel1,
Object vLabel2,
Object label)
 Add an edge between two vertices within the graph. Edge is directed.
Duplicate edges are silently replaced.
Labels on edges may be null.
 Precondition:
 vLabel1 and vLabel2 are labels of existing vertices, v1 & v2
 Postcondition:
 an edge is inserted between v1 and v2.
if edge is new, it is labeled with label (can be null)
 Parameters:
 vLabel1  Source vertex.
 vLabel2  Destination vertex.
 label  Label associated with the edge.
 Overrides:
 addEdge in class GraphList
remove
public Object remove(Object label)
 Remove a vertex from the graph. Associated edges are also
removed. Nonvertices are silently ignored.
 Precondition:
 label is nonnull vertex label
 Postcondition:
 vertex with "equals" label is removed, if found
 Parameters:
 label  The label of the vertex within the graph.
 Returns:
 The label associated with the vertex.
 Overrides:
 remove in class GraphList
removeEdge
public Object removeEdge(Object vLabel1,
Object vLabel2)
 Remove possible edge between vertices labeled vLabel1 and vLabel2.
vLabel1 is the source.
 Precondition:
 vLabel1 and vLabel2 are labels of existing vertices
 Postcondition:
 edge is removed, its label is returned
 Parameters:
 vLabel1  Source vertex.
 vLabel2  Destination vertex.
 Returns:
 The label associated with the edge removed.
 Overrides:
 removeEdge in class GraphList
edgeCount
public int edgeCount()
 Determine the number of edges in graph.
 Postcondition:
 returns the number of edges in graph
 Returns:
 Number of edges in graph.
 Overrides:
 edgeCount in class GraphList
toString
public String toString()
 Construct a string representation of graph.
 Postcondition:
 returns string representation of graph
 Returns:
 String representing graph.
 Overrides:
 toString in class Object
All Packages Class Hierarchy This Package Previous Next Index