st-distance Let's consider the simplest case first:st- distance in an undirected graph. ■How to do it? Even a very inefficient algorithm is ok. S 10𝑠𝑡-distance ◼ Let’s consider the simplest case first: 𝑠𝑡- distance in an undirected graph. ◼ How to do it? ❑ Even a very inefficient algorithm is ok. s t 10