From c50abcfa004506151f1527fcc9f613575cc78048 Mon Sep 17 00:00:00 2001
From: Bruno Freitas Tissei <bft15@inf.ufpr.br>
Date: Wed, 16 May 2018 14:07:43 +0200
Subject: [PATCH] Fix topological sort
Signed-off-by: Bruno Freitas Tissei <bft15@inf.ufpr.br>
---
graph/bipartite_match.cpp | 2 +-
graph/topological_sort.cpp | 3 ++-
2 files changed, 3 insertions(+), 2 deletions(-)
diff --git a/graph/bipartite_match.cpp b/graph/bipartite_match.cpp
index 335b4d0..dde0774 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 a876c25..9f77df1 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);
--
GitLab