Scribd
Upload
10 views

DFS Using User Input

This Java program implements depth-first search (DFS) on a graph using user input for the number of vertices, adjacency matrix, and starting vertex. It takes this input to perform DFS traversal and print the results.

Uploaded by

mechraam5
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
10 views

DFS Using User Input

This Java program implements depth-first search (DFS) on a graph using user input for the number of vertices, adjacency matrix, and starting vertex. It takes this input to perform DFS traversal and print the results.

Uploaded by

mechraam5
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 2

DFS using user input

import java.util.Scanner;

public class GraphDFS {


private int vertices;
private int[][] adjacencyMatrix;

public GraphDFS(int v) {
vertices = v;
adjacencyMatrix = new int[v][v];
}

public void addEdge(int start, int end) {


adjacencyMatrix[start][end] = 1;
adjacencyMatrix[end][start] = 1;
}

public void dfs(int startVertex, boolean[] visited) {


System.out.print(startVertex + " ");
visited[startVertex] = true;

for (int i = 0; i < vertices; i++) {


if (adjacencyMatrix[startVertex][i] == 1 && !visited[i]) {
dfs(i, visited);
}
}
}

public static void main(String[] args) {


Scanner scanner = new Scanner(System.in);

System.out.print("Enter the number of vertices: ");


int v = scanner.nextInt();

GraphDFS graph = new GraphDFS(v);

System.out.println("Enter the adjacency matrix:");


for (int i = 0; i < v; i++) {
for (int j = 0; j < v; j++) {
graph.adjacencyMatrix[i][j] = scanner.nextInt();
}
}
System.out.print("Enter the starting vertex for DFS: ");
int startVertex = scanner.nextInt();

boolean[] visited = new boolean[v];


System.out.print("DFS traversal starting from vertex " + startVertex + ": ");
graph.dfs(startVertex, visited);

scanner.close();
}
}

You might also like