diff options
| author | Alexander Karatarakis <alkarata@microsoft.com> | 2017-04-11 14:30:49 -0700 |
|---|---|---|
| committer | Alexander Karatarakis <alkarata@microsoft.com> | 2017-04-12 22:05:02 -0700 |
| commit | cfbfa0d81327b32478e57cda85059c6063cd4bfd (patch) | |
| tree | 2d3592fb77f6915266ca114247db7439bdde8b66 /toolsrc/include | |
| parent | 612d941afc1339154354145f6fa5264d3c573cc0 (diff) | |
| download | vcpkg-cfbfa0d81327b32478e57cda85059c6063cd4bfd.tar.gz vcpkg-cfbfa0d81327b32478e57cda85059c6063cd4bfd.zip | |
Rename
Diffstat (limited to 'toolsrc/include')
| -rw-r--r-- | toolsrc/include/vcpkg_Graphs.h | 8 |
1 files changed, 4 insertions, 4 deletions
diff --git a/toolsrc/include/vcpkg_Graphs.h b/toolsrc/include/vcpkg_Graphs.h index fb57a38db..b97f7ac50 100644 --- a/toolsrc/include/vcpkg_Graphs.h +++ b/toolsrc/include/vcpkg_Graphs.h @@ -21,7 +21,7 @@ namespace vcpkg::Graphs class Graph { template <class Func> - static void find_topological_sort_internal(V vertex, + static void topological_sort_internal(V vertex, ExplorationStatus& status, const Func adjacency_list_provider, std::unordered_map<V, ExplorationStatus>& exploration_status, @@ -36,7 +36,7 @@ namespace vcpkg::Graphs ExplorationStatus& neighbour_status = exploration_status[neighbour]; if (neighbour_status == ExplorationStatus::NOT_EXPLORED) { - find_topological_sort_internal(neighbour, neighbour_status, adjacency_list_provider, exploration_status, sorted); + topological_sort_internal(neighbour, neighbour_status, adjacency_list_provider, exploration_status, sorted); } else if (neighbour_status == ExplorationStatus::PARTIALLY_EXPLORED) { @@ -70,7 +70,7 @@ namespace vcpkg::Graphs this->vertices[u].insert(v); } - std::vector<V> find_topological_sort() const + std::vector<V> topological_sort() const { std::unordered_map<V, int> indegrees = count_indegrees(); @@ -88,7 +88,7 @@ namespace vcpkg::Graphs ExplorationStatus& status = exploration_status[vertex]; if (status == ExplorationStatus::NOT_EXPLORED) { - find_topological_sort_internal(vertex, + topological_sort_internal(vertex, status, [this](const V& v) { return this->vertices.at(v); }, exploration_status, |