Update all-ancestors-of-a-node-in-a-directed-acyclic-graph.cpp

Author: kamyu104

C++/all-ancestors-of-a-node-in-a-directed-acyclic-graph.cpp

@@ -56,8 +56,8 @@ class Solution2 {
 
 private:
     void bfs(const vector<vector<int>>& adj,
-                  int i,
-                  vector<vector<int>> *result) {
+             int i,
+             vector<vector<int>> *result) {
 
         vector<bool> lookup(size(adj));
         vector<int> q = {i};