Home/Lessons/DSA/Graph BFS — shortest paths on unweighted graphs← All lessonsAdvanced·12 min·dsa · graphs · bfs · interviewGraph BFS — shortest paths on unweighted graphsLoading lesson…← PreviousGraph Representations — adjacency list, matrix, edge listNext →Graph DFS — cycles, components, and back-edges