diff options
| author | Marcin Chrzanowski <marcin.j.chrzanowski@gmail.com> | 2017-01-06 16:55:23 -0500 |
|---|---|---|
| committer | Marcin Chrzanowski <marcin.j.chrzanowski@gmail.com> | 2017-01-06 16:55:23 -0500 |
| commit | df2c6a608a5b238e7b2e5265e05e48535e036263 (patch) | |
| tree | 738e18a6a63389d3e67cdc04655ed93a0e0704cf /src/dependency_calculator.h | |
| parent | ed0ac6791435c36e8374b218454ebfa7485f0845 (diff) | |
Refactor
- Remove unnecessary include
- Improve whitespace
- Remove unnecessary variable declaration
- Move function call to more logical place
Diffstat (limited to 'src/dependency_calculator.h')
| -rw-r--r-- | src/dependency_calculator.h | 2 |
1 files changed, 1 insertions, 1 deletions
diff --git a/src/dependency_calculator.h b/src/dependency_calculator.h index c24f5ef..6141a82 100644 --- a/src/dependency_calculator.h +++ b/src/dependency_calculator.h @@ -3,7 +3,6 @@ #include <queue> #include <stack> -#include <unordered_map> #include <vector> #include "graph.h" @@ -23,6 +22,7 @@ public: private: const Graph& graph_; // (V, E) int vertex_; // s + std::stack<int> stack_; // S std::vector<std::vector<int>> shortest_path_predecessors_; // P std::vector<int> shortest_paths_; // sigma |