Return vertices in a vector

2 files changed, 10 insertions, 3 deletions

diff --git a/src/graph.h b/src/graph.h
index f687ff3..47dce16 100644
--- a/src/graph.h
+++ b/src/graph.h
@@ -13,6 +13,7 @@ public:
     void add_vertex(int vertex) {
         if (vertices_.find(vertex) == vertices_.end()) {
             vertices_.insert(vertex);
+            orderable_vertices_.push_back(vertex);
             graph_[vertex] = std::vector<int>();
         }
     }
@@ -24,8 +25,12 @@ public:
         has_out_edges_.insert(from);
     }
 
-    const std::set<int> & get_vertices() const {
-        return vertices_;
+    void sort_vertices() {
+        std::sort(orderable_vertices_.begin(), orderable_vertices_.end());
+    }
+
+    const std::vector<int> & get_vertices() const {
+        return orderable_vertices_;
     }
 
     const std::vector<int> & get_neighbors(int vertex) const {
@@ -37,7 +42,8 @@ public:
     }
 
 private:
-    std::set<int> vertices_;
+    std::unordered_set<int> vertices_;
+    std::vector<int> orderable_vertices_;
     std::unordered_map<int, std::vector<int>> graph_;
     std::unordered_set<int> has_out_edges_;
 };
diff --git a/src/parse.h b/src/parse.h
index cb6e3c6..1d37083 100644
--- a/src/parse.h
+++ b/src/parse.h
@@ -14,6 +14,7 @@ public:
         while (std::getline(input_file_, edge)) {
             parse_edge_(edge);
         }
+        graph_.sort_vertices();
     }
 
     const Graph & get_graph() {