🔥 minimum spanning tree → MST algorithms rely on BFS-grounded concepts of graph traversal and spanning trees: understanding adjacency exploration and parent/level trees, using BFS to check connectivity (a prerequisite for an MST) and to validate that the chosen edges form a single spanning tree covering all vertices.

🌟 dijkstra algorithm →

⚡️ complete binary tree →

⚡️ shortest path →