Java

Help in depth first search of a graph in adjacency matrix

Please support our Java advertiser: Programming Forums - DaniWeb Sister Site

•

Join Date: Aug 2008

Posts: 11

Reputation: W@n is an unknown quantity at this point

Solved Threads: 0

W@n

Offline

Newbie Poster

Help in depth first search of a graph in adjacency matrix

Oct 25th, 2008

Hi, recently i am doing an assignment that require me to do a depth first search on a given graph. However, i cannot get the result i needed. Is there any wrong with my code? Can anyone help? thank in advance=D

My graph

 Help with Code Tags 
 Java Syntax (Toggle Plain Text) 
 
    0                   4
  /   \                /
 1     2 ---3         5
    0                   4
  /   \                /
 1     2 ---3         5

The depth first search result should be 0,1,2,3 but i can only get 0,1.

my code

 Help with Code Tags 
 Java Syntax (Toggle Plain Text) 
 
 public static void depthFirstRecurse(int v) {
 
        //mark v as visit
        visited = new boolean[g.getGraphSize()];
        visited[v] = true;
 
        System.out.print(v + " ");
 
        for (int u = 1; u < g.getGraphSize(); u++) {
 
            if (visited[u] == false && adjMatrix[u][v] == 1) {
 
                             depthFirstRecurse(u);
 
            }
            return;
        }
 
    }
 public static void depthFirstRecurse(int v) {

        //mark v as visit
        visited = new boolean[g.getGraphSize()];
        visited[v] = true;
        
        System.out.print(v + " ");

        for (int u = 1; u < g.getGraphSize(); u++) {

            if (visited[u] == false && adjMatrix[u][v] == 1) {
                
                             depthFirstRecurse(u);

            }
            return;
        }
        
    }