tolong batu saya #1730

// Konstruktor
@SuppressWarnings("unchecked")
public GraphSearchTugas3(int v) {
    V = v;
    adj = new LinkedList[v];
    for (int i = 0; i < v; ++i) {
        adj[i] = new LinkedList<>();
    }
}

// Menambahkan sisi ke graf
public void addEdge(int v, int w) {
    adj[v].add(w);
}

// Fungsi untuk melakukan DFS
public void DFSUntil(int v, boolean[] visited) {
    visited[v] = true;
    System.out.print("a" + (v + 1) + "");

    Iterator<Integer> i = adj[v].iterator();
    while (i.hasNext()) {
        int n = i.next();
        if (!visited[n]) {
            DFSUntil(n, visited);
        }
    }

    public void DFS(int v) {
        boolean[] visited = new boolean[V];
        DFSUntil(v, visited);
        System.out.println();
    }
}

void BFS(int s) {
    boolean[] visited = new boolean[V];
    LinkedList<Integer> queue = new LinkedList<>();

    visited[s] = true;
    queue.add(s);
    System.out.print("Traversal Bfs(dari " + (s + 1) + "): ");
    while (!queue.isEmpty()) {
        s = queue.poll();
        System.out.print("a" + (s + 1) + " ");

        Iterator<Integer> i = adj[s].iterator();
        while (i.hasNext()) {
            int n = i.next();G
            if (!visited[n]) {
                visited[n] = true;
                queue.add(n);
            }
        }
    }
    System.out.println();
}

public static void main(String[] args) {
    GraphSearchTugas3 g = new GrarphSearchTugas3(8);
    g.addEdge(0, 1);
    g.addEdge(0, 2);
    g.addEdge(1, 3);
    g.addEdge(1, 4);
    g.addEdge(2, 5);
    g.addEdge(3, 6);
    g.addEdge(4, 7);

    g.DFS(0);
    g.BFS(0);
}