![JAVA
Implement the DFS algorithm. The implementation should be able to find the shortest path from
a source to any destination of a directed graph, print both the path and the cost of the path.
Solution
//updated code
import java.util.Scanner;
public class Dij
{
static Scanner scanner
public static void main(String[] args)
{
int[] p = new int[5];
int minimum = 999, nextNode = 0;
scanner = new Scanner(System.in);
int[] distancematrix = new int[5];
int[][] actualmatrix = new int[5][5];
int[] visitedarray = new int[5];
System.out.println("Enter the cost matrix");
for (int i = 0; i < distancematrix.length; i++)
{
visitedarray[i] = 0;
p[i] = 0;
for (int j = 0; j < distancematrix.length; j++)
{
actualmatrix[i][j] = scanner.nextInt();
if (actualmatrix[i][j]==0)
actualmatrix[i][j] = 999;
}
}
distancematrix = actualmatrix[0];
visitedarray[0] = 1;
distancematrix[0] = 0;
for (int counter = 0; counter < 5; counter++)](https://image.slidesharecdn.com/javaimplementthedfsalgorithm-230709135543-708fce34/85/JAVAImplement-the-DFS-algorithm-The-implementation-should-be-able-pdf-1-320.jpg)
![{
min = 999;
for (int i = 0; i < 5; i++)
{
if (minimum > distancematrix[i] && visitedarray[i]!=1)
{
minimum = distancematrix[i];
nextNode = i;
}
}
visitedarray[nextNode] = 1;
for (int i = 0; i < 5; i++)
{
if (visitedarray[i]!=1)
{
if (minimum+actualmatrix[nextNode][i] <
distancematrix[i])
{
distancematrix[i]
=minimum+actualmatrix[nextNode][i];
p[i] = nextNode;
}
}
}
}
for(int i = 0; i < 5; i++)
System.out.print("|" + distancematrix[i]);
System.out.println("|");
int j;
for (int i = 0; i < 5; i++)
{
if (i!=0)
{
System.out.print("Path = " + i);
j = i;
do](https://image.slidesharecdn.com/javaimplementthedfsalgorithm-230709135543-708fce34/85/JAVAImplement-the-DFS-algorithm-The-implementation-should-be-able-pdf-2-320.jpg)
![{
j = p[j];
System.out.print(" <- " + j);
}
while(j != 0);
}
System.out.println();
}
}
}](https://image.slidesharecdn.com/javaimplementthedfsalgorithm-230709135543-708fce34/85/JAVAImplement-the-DFS-algorithm-The-implementation-should-be-able-pdf-3-320.jpg)
JAVAImplement the DFS algorithm. The implementation should be able.pdf
- 1. JAVA Implement the DFS algorithm. The implementation should be able to find the shortest path from a source to any destination of a directed graph, print both the path and the cost of the path. Solution //updated code import java.util.Scanner; public class Dij { static Scanner scanner public static void main(String[] args) { int[] p = new int[5]; int minimum = 999, nextNode = 0; scanner = new Scanner(System.in); int[] distancematrix = new int[5]; int[][] actualmatrix = new int[5][5]; int[] visitedarray = new int[5]; System.out.println("Enter the cost matrix"); for (int i = 0; i < distancematrix.length; i++) { visitedarray[i] = 0; p[i] = 0; for (int j = 0; j < distancematrix.length; j++) { actualmatrix[i][j] = scanner.nextInt(); if (actualmatrix[i][j]==0) actualmatrix[i][j] = 999; } } distancematrix = actualmatrix[0]; visitedarray[0] = 1; distancematrix[0] = 0; for (int counter = 0; counter < 5; counter++)
- 2. { min = 999; for (int i = 0; i < 5; i++) { if (minimum > distancematrix[i] && visitedarray[i]!=1) { minimum = distancematrix[i]; nextNode = i; } } visitedarray[nextNode] = 1; for (int i = 0; i < 5; i++) { if (visitedarray[i]!=1) { if (minimum+actualmatrix[nextNode][i] < distancematrix[i]) { distancematrix[i] =minimum+actualmatrix[nextNode][i]; p[i] = nextNode; } } } } for(int i = 0; i < 5; i++) System.out.print("|" + distancematrix[i]); System.out.println("|"); int j; for (int i = 0; i < 5; i++) { if (i!=0) { System.out.print("Path = " + i); j = i; do
- 3. { j = p[j]; System.out.print(" <- " + j); } while(j != 0); } System.out.println(); } } }