The breadth-first search algorithm · A distance, giving the minimum number of edges in any path from the source vertex to vertex v v vv. · The predecessor vertex ...
確定! 回上一頁