What does this tool do?

It runs Dijkstra, A* (zero or euclidean heuristic), and Bellman-Ford via runShortestPath on weighted directed or undirected graphs, returning the path, distance, visit order, per-node distances, and a deterministic visit/relax/complete step log.

Why does Dijkstra fail on my graph while Bellman-Ford works?

Dijkstra returns an empty path with a negative-edge-weights error whenever any edge is negative (check with hasNegativeEdges). Bellman-Ford relaxes through negatives — e.g. A → D → C at distance −2 — and additionally flags reachable negative cycles with negativeCycle: true.

Is my graph uploaded or stored?

No. Adjacency building, relaxation, and heuristic scoring run entirely in your browser — nodes and edges never leave your device.

How do unreachable nodes and A* heuristics behave?

Unreachable goals yield an empty path with distance Infinity. On the bundled fixture A* with euclidean and zero heuristics agree (A → B → C, distance 4), and re-running Bellman-Ford produces a byte-identical step log.

Graph Shortest Path Lab

Build a graph and replay Dijkstra, A*, or Bellman-Ford step by step in your browser.

Graph builder

Click one node, then another, to add a directed weighted edge.

Select a node to begin drawing an edge.

Start

Goal

New edge weight

Algorithm

Graph Shortest Path Lab

Graph builder

Result

Step playback

Algorithms and Safety Nets: Big-O, Graphs, Hashes, Secrets

3D Affine Transform Visualizer

Exam & Section Timer

Flashcards & Spaced Repetition

GPA & Grade Calculator

Interactive Periodic Table

Perlin & Simplex Terrain Generator

Graph builder

Result

Step playback

Related guides

Algorithms and Safety Nets: Big-O, Graphs, Hashes, Secrets

Related tools

3D Affine Transform Visualizer

Exam & Section Timer

Flashcards & Spaced Repetition

GPA & Grade Calculator

Interactive Periodic Table

Perlin & Simplex Terrain Generator