lesson

Graph Algorithms

17 / 47

50 minlesson

You completed the free preview — you are ready for the full path.

All lessons are readable below. To write and run code from lesson 11 onwards, upgrade to Path Plus ($9/mo) or Pro.

1 min read

Implement BFS, DFS, Dijkstra, and topological sort. Graphs model networks; traversals answer reachability and shortest-path questions.

What You'll Learn

function bfs(graph, start) {
  const visited = new Set();
  const queue = [start];
  const result = [];
  
  while (queue.length) {
// ...

BFS uses queue, finds shortest path; DFS uses stack/recursion, explores deep first
Dijkstra: priority queue, shortest path to all nodes from source
Topological sort: DFS, process nodes in reverse finish time (DAG only)

You completed the free preview — you are ready for the full path.

All lessons are readable below. To write and run code from lesson 11 onwards, upgrade to Path Plus ($9/mo) or Pro.

1 min read

Implement BFS, DFS, Dijkstra, and topological sort. Graphs model networks; traversals answer reachability and shortest-path questions.

function bfs(graph, start) {
  const visited = new Set();
  const queue = [start];
  const result = [];
  
  while (queue.length) {
// ...

BFS uses queue, finds shortest path; DFS uses stack/recursion, explores deep first
Dijkstra: priority queue, shortest path to all nodes from source
Topological sort: DFS, process nodes in reverse finish time (DAG only)

1 min read

Implement BFS, DFS, Dijkstra, and topological sort. Graphs model networks; traversals answer reachability and shortest-path questions.

function bfs(graph, start) {
  const visited = new Set();
  const queue = [start];
  const result = [];
  
  while (queue.length) {
// ...

BFS uses queue, finds shortest path; DFS uses stack/recursion, explores deep first
Dijkstra: priority queue, shortest path to all nodes from source
Topological sort: DFS, process nodes in reverse finish time (DAG only)

1 min read

Implement BFS, DFS, Dijkstra, and topological sort. Graphs model networks; traversals answer reachability and shortest-path questions.

function bfs(graph, start) {
  const visited = new Set();
  const queue = [start];
  const result = [];
  
  while (queue.length) {
// ...

BFS uses queue, finds shortest path; DFS uses stack/recursion, explores deep first
Dijkstra: priority queue, shortest path to all nodes from source
Topological sort: DFS, process nodes in reverse finish time (DAG only)