CS188相關

#CS188html uniformed BFS breadth-first time-complexity: O ( b s ) O(b^s) O(bs) sapce-complexity: O ( b s ) O(b^s) O(bs) complete:yes optimal:yes(only when the cost = 1) b b b is the number of nodes of

>>阅读原文<<