Class GraphAbstract

java.lang.Object

GraphAbstract

Direct Known Subclasses:

GraphImplementation

public abstract class GraphAbstract
extends java.lang.Object

Nested Class Summary

Nested Classes

Modifier and Type	Class	Description
class	GraphAbstract.GraphEdge
class	GraphAbstract.GraphNode

Field Summary

Fields

Modifier and Type	Field	Description
static java.util.ArrayList<GraphAbstract.GraphNode>	cities
static java.util.ArrayList<GraphAbstract.GraphEdge>	mileages

Constructor Summary

Constructors

Constructor	Description
GraphAbstract()

Method Summary

Modifier and Type	Method	Description
abstract void	breadthFirst(java.lang.String startCity)
abstract void	depthFirst(java.lang.String startCity)
abstract void	readGraph(java.lang.String filename)	Reads mileage chart from CSV file and builds lists of nodes (cities) and edges (distances).
abstract void	shortestPath(java.lang.String fromCity, java.lang.String toCity)
abstract void	writeGraph(java.lang.String filename)	Writes mileage graph to DOT file.

Methods inherited from class java.lang.Object

clone, equals, finalize, getClass, hashCode, notify, notifyAll, toString, wait, wait, wait

Field Detail

cities

public static java.util.ArrayList<GraphAbstract.GraphNode> cities

mileages

public static java.util.ArrayList<GraphAbstract.GraphEdge> mileages

Constructor Detail

GraphAbstract

public GraphAbstract()

Method Detail

readGraph

public abstract void readGraph(java.lang.String filename)

Reads mileage chart from CSV file and builds lists of nodes (cities) and edges (distances).

The first line contains all the cities which should be represented as GraphAbstract.GraphNodes
The successive lines start with a city, followed by a list of mileages to other cities.

To avoid redundancy, not all the values are filled in, ignore empty entries.
When you read a mileage, for example from Fort Collins to Denver, create only one entry in the mileages array, but add the edge to both cities.

First extract all the edges, then sort the edges by mileage, then add the edges associated with each node.

Parameters:

filename - the CSV file

writeGraph

public abstract void writeGraph(java.lang.String filename)

Writes mileage graph to DOT file.

Traverses the data structures created above and writes nodes and edges in GraphViz format. You will build the GraphViz format into an ArrayList, which will then be written to file using the GraphImplementation.writeFile(String, ArrayList) method.

Use the provided example and the following directions to implement this method:

• All attributes of nodes and edges that are identical are put into the header of the .dot file.
• The nodes are labeled Node0, Node1, etc., in the same order as the input file, and they have city names as labels.
• The edges are then written, in the format Node0 -> Node1, etc. and labeled with a distance and color.

The edge color should be green for \u2264100 miles, blue for \u2264200 miles, magenta for \u2264300 miles, and red otherwise.

HINT: Match the file format exactly as provided in order to pass automated grading!

Parameters:

filename - the output file name

depthFirst

public abstract void depthFirst(java.lang.String startCity)

breadthFirst

public abstract void breadthFirst(java.lang.String startCity)

shortestPath

public abstract void shortestPath(java.lang.String fromCity,
                                  java.lang.String toCity)