广度优先 G6定是树址i t reachable from s. It computes the distance (sm number of edges) from s in the breadth-first tree from s to v corresponds to a"shortest path"from s to u 定最短吗?广度优先 一定是棵树 吗？ 一定最短吗？ 显然？