diff --git a/graph/bipartite_match.cpp b/graph/bipartite_match.cpp
index 335b4d051c42a043cdacd24988b4dd28a77bd14a..dde07749d568fbed8d026c292c289a3425965019 100644
--- a/graph/bipartite_match.cpp
+++ b/graph/bipartite_match.cpp
@@ -23,7 +23,7 @@ int dfs(int x) {
   return 0;
 }
 
-// Return number of left elements in matching and fills match array with the 
+// Returns number of left elements in matching and fills match array with the 
 // match itself (match[right_i] = left_i)
 int bipartite_matching(int n) {
   int ans = 0;
diff --git a/graph/topological_sort.cpp b/graph/topological_sort.cpp
index a876c25ee1fcffb9a6fcac5d293a3ca3f0ac894f..9f77df1874891bcbeab8f9895e963ef354fddf38 100644
--- a/graph/topological_sort.cpp
+++ b/graph/topological_sort.cpp
@@ -28,7 +28,8 @@ bool dfs(int x) {
 }
 
 
-// Return topological sort of graph with n vertices
+// Returns if graph contains cycle or not, and fills tsort vector with
+// topological sort of the graph
 bool topological_sort(int n, vector<int> &tsort) {
   memset(cont, 0, sizeof cont);