Distance Next we focus on undirected graphs Directed graphs are similarly handled. A path from i to j:i→v1→v2→…→vk→j: There may be more than one path from i to j. d(i,)=#edges of a shortest path from i to j 3 N(v)={v's neighbors) ={u:d(,u)=1}Distance ◼ Next we focus on undirected graphs ❑ Directed graphs are similarly handled. ◼ A path from 𝑖 to 𝑗: 𝑖 → 𝑣1 → 𝑣2 → ⋯ → 𝑣𝑘 → 𝑗. ❑ There may be more than one path from 𝑖 to 𝑗. ◼ 𝑑(𝑖,𝑗) = # edges of a shortest path from 𝑖 to 𝑗 ◼ 𝑁(𝑣) = {𝑣’s neighbors} = {𝑢: 𝑑(𝑣, 𝑢) = 1} 3 1 2 4 7