Explain what's space efficiency for depth-first search and breadth-first search of a graph(not a tree). That is what the extra space needs for these two methods? And what the worst case and except average case for the space complexity for depth-first search and breadth-first search of a graph(not a tree)?

Answer rating: 100% (QA)

In the context of graph traversal algorithms space efficiency refers to the amount of extra space or ... View the full answer