graphic

- G = (V, E) - BFS, use FIFO queue to process all adjacent vertices. generate only one tree. it can be used for shortest path (without weight on path) of two vertices. - DFS, process it with start tim

>>阅读原文<<