Print All Paths

I/O:

7

8

0 1 10

1 2 10

2 3 10

0 3 10

3 4 10

4 5 10

5 6 10

4 6 10

0

6

O/P:

0123456

012346

03456

0346

import java.io.*;
import java.util.*;

public class Print_All_Faith {
    static class Edge {
        int src;
        int nbr;
        int wt;

        Edge(int src, int nbr, int wt) {
            this.src = src;
            this.nbr = nbr;
            this.wt = wt;
        }
    }

    public static void main(String[] args) throws Exception {
        BufferedReader br = new BufferedReader(new InputStreamReader(System.in));

        int vtces = Integer.parseInt(br.readLine());
        ArrayList<Edge>[] graph = new ArrayList[vtces];
        for (int i = 0; i < vtces; i++) {
            graph[i] = new ArrayList<>();
        }

        int edges = Integer.parseInt(br.readLine());
        for (int i = 0; i < edges; i++) {
            String[] parts = br.readLine().split(" ");
            int v1 = Integer.parseInt(parts[0]);
            int v2 = Integer.parseInt(parts[1]);
            int wt = Integer.parseInt(parts[2]);
            graph[v1].add(new Edge(v1, v2, wt));
            graph[v2].add(new Edge(v2, v1, wt));
        }

        int src = Integer.parseInt(br.readLine());
        int dest = Integer.parseInt(br.readLine());

        // write all your codes here
        boolean[] visited = new boolean[vtces];
        printPath(graph, src, dest, visited, "");
    }

    private static void printPath(ArrayList<Edge>[] graph, int src, int dest, boolean[] visited, String asf) {
        if (src == dest) {
            asf += src;
            System.out.println(asf);
            return;
        }
        visited[src] = true;
        asf += src;
        for (Edge e : graph[src]) {
            if (!visited[e.nbr]) {
                printPath(graph, e.nbr, dest, visited, asf);
            }
        }
        visited[src] = false;

    }


}