stongy -> strongly + remove std::

mhayter · mhayter · commit 54c4ea2db415 · 2024-10-09T03:51:48.000-04:00
diff --git a/src/graph/strongly-connected-components.md b/src/graph/strongly-connected-components.md
@@ -88,7 +88,7 @@ void dfs(int v, vector<vector<int>> const& adj, vector<int> &output) {
 // input: adj -- adjacency list of G
 // output: components -- the strongy connected components in G
 // output: adj_cond -- adjacency list of G^SCC (by root vertices)
-void strongy_connected_components(vector<vector<int>> const& adj,
+void strongly_connected_components(vector<vector<int>> const& adj,
                                   vector<vector<int>> &components,
                                   vector<vector<int>> &adj_cond) {
     int n = adj.size();
@@ -117,7 +117,7 @@ void strongy_connected_components(vector<vector<int>> const& adj,
     // second series of depth first searches
     for (auto v : order)
         if (!visited[v]) {
-            std::vector<int> component;
+            vector<int> component;
             dfs(v, adj_rev, component);
             sort(component.begin(), component.end());
             components.push_back(component);
diff --git a/test/test_strongly_connected_components.cpp b/test/test_strongly_connected_components.cpp
@@ -28,7 +28,7 @@ int main() {
     adj[9].push_back(4);
 
     vector<vector<int>> components, adj_scc;
-    strongy_connected_components(adj, components, adj_scc);
+    strongly_connected_components(adj, components, adj_scc);
 
     // sort things to make it easier to verify
     sort(components.begin(), components.end(),
