lisyarus/psemek
1
0
Fork 1
Code Issues Pull requests Projects Releases Packages Wiki Activity Actions

Use util::hash_map instead of std::unordered_map for pathfinder

Browse source
This commit is contained in:
Nikita Lisitsa 2024-01-29 17:44:27 +03:00
parent 64a6713b61
commit 099a09e4d9
1 changed files with 5 additions and 5 deletions
Show stats Download patch file Download diff file Expand all files Collapse all files

10
libs/util/include/psemek/util/find_path.hpp
View file

@ -1,8 +1,8 @@
#pragma once
#include <psemek/util/functional.hpp>
#include <psemek/util/hash_table.hpp>
#include <unordered_map>
#include <set>
#include <deque>
#include <optional>
@ -15,7 +15,7 @@ namespace psemek::util
{
struct node_compare
{
std::unordered_map<Node, Cost> const & priority;
util::hash_map<Node, Cost> const & priority;
bool operator()(Node const & n1, Node const & n2) const
{
@ -34,9 +34,9 @@ namespace psemek::util
HeuristicFn heuristic;
EdgeCallback edge_callback;
std::unordered_map<Node, Cost> cost;
std::unordered_map<Node, Cost> priority;
std::unordered_map<Node, Node> previous;
util::hash_map<Node, Cost> cost;
util::hash_map<Node, Cost> priority;
util::hash_map<Node, Node> previous;
std::set<Node, node_compare> queue;
pathfinder(NeighboursFn && node_neighbours, HeuristicFn && heuristic, EdgeCallback && edge_callback)