//----------------------------------------------------------------
//	File:		graph.java
//	Purpose:	Implement a directed, weighted graph class via an Adjacency Matrix
//  Author : 
//  Last Modified : 
//  Comments : 
//----------------------------------------------------------------

public class Graph { 

private int numEdges;
private int numVertices;
private double [][] M; 
private final double NO_EDGE = 1.0e100;	//define NO_EDGE's value for class

public void SetSize(int n) 
{
	// complete (see notes)
}

public void AddEdge(int origin, int destination, double value) 
{
	 // complete (see notes)
}

public void RemoveEdge(int origin, int destination) 
{
	// complete (see notes)
}

public boolean HasEdge(int origin, int destination)
{
   // complete
   return true;
}

public double EdgeValue(int origin, int destination)
{
   // complete
   return 0.00;
}


public void print() {

}

}