Something went wrong. Try again.
Codelabs for major subjects in the BSIT course at STI College Meycauayan. gitlab.com/andreijiroh-dev/labs/studentops-codelab
codelabs labs
Something went wrong. Try again.
876 B · 35 lines
Java
at main
123456789101112131415161718192021222324252627282930313233343536package dev.andreijiroh.studentops.projects.dsaLabs;import java.util.*;
public class DFSExample { static class Graph { private final Map<String, List<String>> adj = new HashMap<>();
void addEdge(String u, String v) { adj.computeIfAbsent(u, k -> new ArrayList<>()).add(v); adj.computeIfAbsent(v, k -> new ArrayList<>()).add(u); }
void dfs(String u, Set<String> visited) { visited.add(u); System.out.print(u + ""); for (String v : adj.getOrDefault(u, List.of())) { if (!visited.contains(v)) { dfs(v, visited); } } } }
public static void main(String[] args) { Graph g = new Graph();
g.addEdge("A", "B"); g.addEdge("A", "C"); g.addEdge("B", "D"); g.addEdge("C", "D");
System.out.println("DFS Traversal starting from A:"); g.dfs("A", new HashSet<>()); }}