Find the Shortest Path in an Undirected Graph from a source to every other node when every edge costs 1. We build intuition for Breadth-First Search, walk through the code line by line, add a dry run, and finish with precise Big-O analysis.<\/p>\n\n\n\n
Here’s the [Problem Link<\/span><\/mark><\/a><\/strong>] to begin with.<\/p>\n\n\n You are given an undirected<\/strong> graph with For a given source vertex 1. Problem statement<\/h2>\n\n\n\n
n<\/code> vertices (0 \u2026 n-1<\/code>).
All edges have unit weight<\/strong> (cost = 1).<\/p>\n\n\n\nsrc<\/code>, return an array distance<\/code> where<\/p>\n\n\n\n\n
distance[i]<\/code> = the fewest edges<\/strong> needed to reach vertex i<\/code> from src<\/code>,<\/li>\n\n\n\n-1<\/code>.<\/li>\n<\/ul>\n\n\n\n
\n\n\n\n2. Example<\/h2>\n\n\n\n