Depth First Search help

Question

I have an assignment to do on a graph and have to apply depth first search so it ouputs the vertices in a order. I understand the algorithm and can do it on paper but i cannot do it in code so if anyone can help me on this. Here are the classes i am working with
public class MatrixGraph extends AbstractGraph {
    private double[][] matrix;
    public MatrixGraph(int nV, boolean direct, boolean weight ){
        super(nV, direct, weight);
        matrix = new double[nV][nV];
        // if a weighted graph set all values to Double.POSITIVE_INFINITY 
        // otherwise set all values to 0
        //complete this code
    public boolean isEdge(int source, int dest) {
        throw new UnsupportedOperationException("Not supported yet.");
    public void insert(Edge edge) {
        throw new UnsupportedOperationException("Not supported yet.");
    public void remove(Edge edge) {
        throw new UnsupportedOperationException("Not supported yet.");
    public void depthFirstTraversal(int start){
        //Output the vertices in depth first order
public abstract class AbstractGraph implements Graph {
    private int numV;
    private boolean directed;
    private boolean weighted;
    public AbstractGraph(int nV, boolean direct, boolean weight){
        numV = nV;
        directed = direct;     
        weighted = weight;
    public int getNumV() {
        return numV;
    public boolean isDirected() {
        return directed;
    public boolean isWeighted() {
        return weighted;
public interface Graph {
    //returns the number of vertices
    int getNumV();
    // determine if this is a directed graph
    boolean isDirected();
    // determine if this is a weighted graph
    boolean isWeighted();
    // determine if an edge exists between source and destination
    boolean isEdge(int source, int dest);
    void insert(Edge edge);
    void remove(Edge edge);
}

Answer 1

JavaLearner2009 wrote:
public void depthFirstTraversal(int start){
//Output the vertices in depth first order
}I need help on this part i don't know how to write it.You mentioned you understand the algorithm and can do it on paper so what have you tried so far?
If you are completely stuck on implementing the traversal in Java, provide pseudo code.
Mel