Improve readability
This commit is contained in:
@@ -14,7 +14,7 @@ class BreadthFirstSearch {
|
||||
public:
|
||||
BreadthFirstSearch() = default;
|
||||
|
||||
BreadthFirstSearch(std::unordered_map<T, std::unordered_set<T>> adjList)
|
||||
explicit BreadthFirstSearch(std::unordered_map<T, std::unordered_set<T>> adjList)
|
||||
: adjList(adjList) {}
|
||||
|
||||
// Traverse whole graph using the BFS search, and save the tree graph
|
||||
|
||||
Reference in New Issue
Block a user