Add steps in short for kosaraju's Algorithm

nandwalritik · Jul 17, 2021 · 2f7b684 · 2f7b684
1 parent d96321f
commit 2f7b684
Showing 1 changed file with 7 additions and 1 deletion.
diff --git a/graph/kosaraju.cpp b/graph/kosaraju.cpp
@@ -1,6 +1,12 @@
 #include<bits/stdc++.h>
 using namespace std;
+/*
+	Method
+		1.) Find topological sort
+		2.) Find the Transpose of Graph
+		3.) Perform dfs on transposed graph to find the component 
 
+*/
 void dfs1(vector<int> &order,vector<bool> &visited,vector<vector<int>> &adj,int u){
 	visited[u] = true;
 	for(auto x:adj[u])
@@ -54,4 +60,4 @@ int main(){
 
 
 	return 0;
-}
+}