Semantic Web Academy — home

Pathfinding

BFS, Dijkstra, A* — graph routing built into the database.

0/3 done

Overview

Pathfinding

BFS, Dijkstra, A* — graph routing built into the database.

Why it matters

Pathfinding is the canonical first GDS algorithm — once you can compute shortest paths inside the DB you can answer routing, supply-chain and fraud questions without exporting.

Make it stick

Use the prompts below to anchor pathfinding to a real graph you own.

  • ›Pick a graph workload you've shipped — where would *pathfinding* have changed the design?
  • ›What's the smallest version of this pattern you could prototype on a real dataset next sprint?
  • ›What is the most likely *misuse* of this idea, and how would you catch it in a model or query review?

Reading in progress · 0 of 3 activities done