Map Finished:On unweighted graphs,distance defined as the min of edges 口BFS Complexity:0(V+E ■Next: non-negative weighted graphs. Negative weighted graphs 23Map ◼ Finished: On unweighted graphs, distance defined as the min # of edges ❑ BFS ❑ Complexity: 𝑂(|𝑉| + |𝐸|) ◼ Next: ❑ non-negative weighted graphs. ❑ Negative weighted graphs 23