Dijkstra's Algorithm in Java: Finding the Shortest Path

Dijkstra's algorithm is the industry standard for finding the shortest path from a starting node to all other nodes in a graph with non-negative edge weights.

Whether you are building a navigation system like Google Maps or optimizing network packet routing, Dijkstra is the core engine.

The Core Concept: Greedy Exploration

Mental Model

Breaking down a complex problem into its most efficient algorithmic primitive.

Dijkstra's algorithm is greedy. It always picks the "closest" unvisited node and relaxes its neighbors (updates their shortest known distance).

The Logic:

1. Initialize a distances array with infinity, except for the source node which is 0.
2. Use a Min-Heap (PriorityQueue) to store nodes as (distance, nodeId) pairs.
3. While the heap is not empty:
   • Pop the node with the smallest distance.
   • For each neighbor, calculate newDist = currentDist + weight(current, neighbor).
   • If newDist is smaller than the current known distance to the neighbor, update it and push the neighbor to the heap.

Dijkstra Implementation in Java

import java.util.*;

public class Dijkstra {
    static class Edge {
        int target, weight;
        Edge(int t, int w) { target = t; weight = w; }
    }

    static class Node implements Comparable<Node> {
        int id, distance;
        Node(int i, int d) { id = i; distance = d; }
        
        @Override
        public int compareTo(Node other) {
            return Integer.compare(this.distance, other.distance);
        }
    }

    public int[] shortestPath(int n, List<List<Edge>> adj, int startNode) {
        int[] dist = new int[n];
        Arrays.fill(dist, Integer.MAX_VALUE);
        dist[startNode] = 0;

        PriorityQueue<Node> pq = new PriorityQueue<>();
        pq.add(new Node(startNode, 0));

        while (!pq.isEmpty()) {
            Node current = pq.poll();
            int u = current.id;

            // Important: If we found a better path already, skip this stale node
            if (current.distance > dist[u]) continue;

            for (Edge edge : adj.get(u)) {
                int v = edge.target;
                int weight = edge.weight;

                if (dist[u] + weight < dist[v]) {
                    dist[v] = dist[u] + weight;
                    pq.add(new Node(v, dist[v]));
                }
            }
        }
        return dist;
    }
}

When to use Dijkstra?

Common Interview Pitfalls

1. Negative Weights: Dijkstra does not work with negative edge weights. You need the Bellman-Ford algorithm for that.
2. Cycle Handling: Dijkstra naturally handles cycles in positive weighted graphs, but you should always include the if (current.distance > dist[u]) continue; check to avoid re-processing stale entries in the PriorityQueue.
3. Memory: If the graph is very dense, $E$ can be up to $V^2$, making the priority queue operations more expensive.

Summary

Dijkstra's algorithm is a masterclass in greedy optimization. By always focusing on the most promising (closest) node first, it guarantees the shortest path to every node in a single pass of exploration. Mastering this algorithm demonstrates a deep understanding of both graph theory and the efficient use of the Heap data structure.

Engineering Standard: The "Staff" Perspective

In high-throughput distributed systems, the code we write is often the easiest part. The difficulty lies in how that code interacts with other components in the stack.

1. Data Integrity and The "P" in CAP

Whenever you are dealing with state (Databases, Caches, or In-memory stores), you must account for Network Partitions. In a standard Java microservice, we often choose Availability (AP) by using Eventual Consistency patterns. However, for financial ledgers, we must enforce Strong Consistency (CP), which usually involves distributed locks (Redis Redlock or Zookeeper) or a strictly linearizable sequence.

2. The Observability Pillar

Writing logic without observability is like flying a plane without a dashboard. Every production service must implement:

• Tracing (OpenTelemetry): Track a single request across 50 microservices.
• Metrics (Prometheus): Monitor Heap usage, Thread saturation, and P99 latencies.
• Structured Logging (ELK/Splunk): Never log raw strings; use JSON so you can query logs like a database.

3. Production Incident Prevention

To survive a 3:00 AM incident, we use:

• Circuit Breakers: Stop the bleeding if a downstream service is down.
• Bulkheads: Isolate thread pools so one failing endpoint doesn't crash the entire app.
• Retries with Exponential Backoff: Avoid the "Thundering Herd" problem when a service comes back online.

Critical Interview Nuance

When an interviewer asks you about this topic, don't just explain the code. Explain the Trade-offs. A Staff Engineer is someone who knows that every architectural decision is a choice between two "bad" outcomes. You are picking the one that aligns with the business goal.

Performance Checklist for High-Load Systems:

1. Minimize Object Creation: Use primitive arrays and reusable buffers.
2. Batching: Group 1,000 small writes into 1 large batch to save I/O cycles.
3. Async Processing: If the user doesn't need the result immediately, move it to a Message Queue (Kafka/SQS).

Advanced Architectural Blueprint: The Staff Perspective

In modern high-scale engineering, the primary differentiator between a Senior and a Staff Engineer is the ability to see beyond the local code and understand the Global System Impact. This section provides the exhaustive architectural context required to operate this component at a "MANG" (Meta, Amazon, Netflix, Google) scale.

1. High-Availability and Disaster Recovery (DR)

Every component in a production system must be designed for failure. If this component resides in a single availability zone, it is a liability.

• Multi-Region Active-Active: To achieve "Five Nines" (99.999%) availability, we replicate state across geographical regions using asynchronous replication or global consensus (Paxos/Raft).
• Chaos Engineering: We regularly inject "latency spikes" and "node kills" using tools like Chaos Mesh to ensure the system gracefully degrades without a total outage.

2. The Data Integrity Pillar (Consistency Models)

When managing state, we must choose our position on the CAP theorem spectrum.

3. Observability and "Day 2" Operations

Writing the code is only 10% of the lifecycle. The remaining 90% is spent monitoring and maintaining it.

• Tracing (OpenTelemetry): We use distributed tracing to map the request flow. This is critical when a P99 latency spike occurs in a mesh of 100+ microservices.
• Structured Logging: We avoid unstructured text. Every log line is a JSON object containing correlationId, tenantId, and latencyMs.
• Custom Metrics: We export business-level metrics (e.g., "Orders processed per second") to Prometheus to set up intelligent alerting with PagerDuty.

4. Production Readiness Checklist for Staff Engineers

• Capacity Planning: Have we performed load testing to find the "Breaking Point" of the service?
• Security Hardening: Is all communication encrypted using mTLS (Mutual TLS)?
• Backpressure Propagation: Does the service correctly return HTTP 429 or 503 when its internal thread pools are saturated?
• Idempotency: Can the same request be retried 10 times without side effects? (Critical for Payment systems).

Critical Interview Reflection

When an interviewer asks "How would you improve this?", they are looking for your ability to identify Bottlenecks. Focus on the network I/O, the database locking strategy, or the memory allocation patterns of the JVM. Explain the trade-offs between "Throughput" and "Latency." A Staff Engineer knows that you can never have both at their theoretical maximums.

Optimization Summary:

1. Reduce Context Switching: Use non-blocking I/O (Netty/Project Loom).
2. Minimize GC Pressure: Prefer primitive specialized collections over standard Generics.
3. Data Sharding: Use Consistent Hashing to avoid "Hot Shards."

Key Takeaways

• Pop the node with the smallest distance.
• For each neighbor, calculate newDist = currentDist + weight(current, neighbor).
• If newDist is smaller than the current known distance to the neighbor, update it and push the neighbor to the heap.

Read Next

• MANG Problem #31: Regular Expression Matching (Hard)
• Huffman Coding in Java: Lossless Data Compression
• AVL Trees: Self-Balancing Binary Search Trees