Breadth-First Search 廣度優先搜索

1. The shortest-paths problem Distance δ(s, v) : The length of the shortest path from s to v. For example δ(s, c)=2. The problem： Input： A graph G = (V, E) and a source vertex s∈V Question： A shortest

>>阅读原文<<