java 37 lines · 7 steps

Breadth-first search on an adjacency-list graph

An undirected graph backed by a HashMap, traversed level by level with a queue.

Explained by highlit
1import java.util.ArrayDeque;
2import java.util.ArrayList;
3import java.util.HashMap;
4import java.util.HashSet;
5import java.util.List;
6import java.util.Map;
7import java.util.Queue;
8import java.util.Set;
9 
10public class Graph {
11 private final Map<Integer, List<Integer>> adjacency = new HashMap<>();
12 
13 public void addEdge(int from, int to) {
14 adjacency.computeIfAbsent(from, k -> new ArrayList<>()).add(to);
15 adjacency.computeIfAbsent(to, k -> new ArrayList<>()).add(from);
16 }
17 
18 public List<Integer> bfs(int start) {
19 List<Integer> order = new ArrayList<>();
20 Set<Integer> visited = new HashSet<>();
21 Queue<Integer> queue = new ArrayDeque<>();
22 
23 queue.add(start);
24 visited.add(start);
25 
26 while (!queue.isEmpty()) {
27 int node = queue.poll();
28 order.add(node);
29 for (int neighbor : adjacency.getOrDefault(node, List.of())) {
30 if (visited.add(neighbor)) {
31 queue.add(neighbor);
32 }
33 }
34 }
35 return order;
36 }
37}
01 / 01
STEP 01

Walkthrough

Space play ←→ step click any line
Three takeaways
  1. 1An adjacency map of node to neighbor list is a compact, flexible way to represent sparse graphs.
  2. 2BFS visits nodes in distance order by processing a FIFO queue and marking nodes the moment they're enqueued.
  3. 3Set.add returning a boolean lets you check membership and record it in one branchless step.

Related explainers

java
@Component
@Converter
public class EncryptedStringConverter implements AttributeConverter<String, String> {
 

Transparent column encryption in Spring & JPA

encryption aes-gcm jpa-converter
Advanced 10 steps
java
package com.acme.billing.config;
 
import org.springframework.boot.autoconfigure.condition.ConditionalOnProperty;
import org.springframework.boot.context.properties.ConfigurationProperties;

Feature-flagged beans with Spring @ConditionalOnProperty

feature-flags conditional-beans strategy-pattern
Intermediate 5 steps
java
public static Map<String, String> parseCookieHeader(String header) {
    Map<String, String> cookies = new LinkedHashMap<>();
    if (header == null || header.isBlank()) {
        return cookies;

Parsing an HTTP Cookie header in Java

string-parsing http url-decoding
Intermediate 6 steps
java
public class TimedSocketReader {
 
    private static final int READ_TIMEOUT_MS = 5_000;
    private static final int CONNECT_TIMEOUT_MS = 3_000;

Reading a socket with connect and read timeouts

sockets timeouts io
Intermediate 8 steps
java
public final class EncodingDetector {
 
    public enum Encoding {
        UTF_8, UTF_16LE, UTF_16BE, UTF_32LE, UTF_32BE, ASCII, UNKNOWN

Detecting text encoding from raw bytes in Java

byte-manipulation encoding-detection bitwise-operations
Intermediate 8 steps
java
public final class ImportOrganizer {
 
    private static final Pattern IMPORT_LINE =
            Pattern.compile("^import\\s+(static\\s+)?([\\w.]+(?:\\.\\*)?)\\s*;\\s*$");

Sorting Java imports with a regex pass

regex sorting text-processing
Intermediate 8 steps

Share this explainer

Here's the card — post it anywhere.

Breadth-first search on an adjacency-list graph — share card
Made with highlit — turn any snippet into a walkthrough like this in about a minute.
Explain your code