Skip to content

Project

CareerGraph

Career paths as a weighted graph, solved with Dijkstra

Solo build · Projects · 2026 · 2:37

A recommendation engine that treats a career as a routing problem: roles are nodes, transitions are weighted edges, and the cost of an edge is the skills you would have to learn. It finds the cheapest path from where you are to the job you want, shows the exact skill gaps along the way, and attaches resources to close each one.

Highlights

  • Graph model in NetworkX built from real career-transition data, with required skills stored on every role
  • Dijkstra over skill-gap-weighted edges, so the best route is the one that asks least of you, not the fewest hops
  • FastAPI service with Pydantic-validated endpoints behind an interactive force-directed graph in React
  • Skill-gap analysis between current and target role, with learning resources mapped to each gap
  • Containerised with Docker Compose for one-command development and production setups