Fix topological sort

Signed-off-by: Bruno Freitas Tissei <bft15@inf.ufpr.br>

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;

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);