Space Complexity in Breadth First Search (BFS) Algorithm – Artificial Intelligence
According to Artificial Intelligence A Modern Approach - Stuart J. Russell , Peter Norvig (Version 4), space complexity of BFS is O(b^d), where 'b' is branching factor and 'd' is depth. Complexity of BFS is obtained by this assumption: we…