diff options
author | Marcin Chrzanowski <marcin.j.chrzanowski@gmail.com> | 2017-01-05 00:26:34 -0500 |
---|---|---|
committer | Marcin Chrzanowski <marcin.j.chrzanowski@gmail.com> | 2017-01-05 11:52:19 -0500 |
commit | 98844eccedfb84fac46c83d59a1298cce491f77b (patch) | |
tree | 52e4ab6f472b59c90f0ae34505daabfec5185333 /src/dependency_calculator.h | |
parent | 02d18af55aaf50b57b3a57891dac74a9b1a36b60 (diff) |
Switch to unordered maps and sets
Diffstat (limited to 'src/dependency_calculator.h')
-rw-r--r-- | src/dependency_calculator.h | 10 |
1 files changed, 5 insertions, 5 deletions
diff --git a/src/dependency_calculator.h b/src/dependency_calculator.h index 1c77991..be6aeb7 100644 --- a/src/dependency_calculator.h +++ b/src/dependency_calculator.h @@ -4,7 +4,7 @@ #include <stack> #include <queue> #include <vector> -#include <map> +#include <unordered_map> #include "graph.h" @@ -24,11 +24,11 @@ private: const Graph &graph_; // (V, E) int vertex_; // s std::stack<int> stack_; // S - std::map<int, std::vector<int>> shortest_path_predecessors_; // P - std::map<int, int> shortest_paths_; // sigma - std::map<int, int> distance_; // d + std::unordered_map<int, std::vector<int>> shortest_path_predecessors_; // P + std::unordered_map<int, int> shortest_paths_; // sigma + std::unordered_map<int, int> distance_; // d std::queue<int> queue_; // Q - std::map<int, double> dependency_; // delta + std::unordered_map<int, double> dependency_; // delta void init_() { for (int vertex : graph_.get_vertices()) { |