Refactor: Replace std::map and std::set with unordered versions
This commit is contained in:
@@ -109,7 +109,8 @@ TEST_SUITE("Algorithm") {
|
||||
auto tree =
|
||||
algo::BreadthFirstSearch<std::uint16_t>(G.adjList).execute(1);
|
||||
|
||||
std::map<std::uint16_t, std::set<std::uint16_t>> expected = {
|
||||
std::unordered_map<std::uint16_t,
|
||||
std::unordered_set<std::uint16_t>> expected = {
|
||||
{1, {2}},
|
||||
{2, {3, 6}},
|
||||
{3, {4}},
|
||||
|
||||
Reference in New Issue
Block a user