From cfbfa0d81327b32478e57cda85059c6063cd4bfd Mon Sep 17 00:00:00 2001
From: Alexander Karatarakis <alkarata@microsoft.com>
Date: Tue, 11 Apr 2017 14:30:49 -0700
Subject: Rename

---
 toolsrc/include/vcpkg_Graphs.h | 8 ++++----
 1 file changed, 4 insertions(+), 4 deletions(-)

(limited to 'toolsrc/include')

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,
-- 
cgit v1.2.3