Advanced Graphs

Weighted shortest paths and connectivity beyond plain BFS/DFS — Dijkstra, Union-Find, and minimum spanning trees.

Read

46 min

Practice MCQs

25

Interview QA

25

Edition

v7

Editorial status

Reviewed

Relevant for

AI Engineer,Backend Engineer,Blockchain Developer,Computational Biologist,Data Scientist,Embedded Systems Engineer,Frontend Engineer,Full-Stack Developer,Machine Learning Engineer,Quantum Software Engineer,Robotics Engineer,Software Engineer

Scope: Language-neutral, with implementation notes referring to CPython 3.14 containers.