Update comments on files. (#78)

Author: abner-vidal3

content/graphs/flow-matching/dinic.cpp

@@ -1,8 +1,8 @@
 /*
-*Author:* Pablo Messina
-*Source:* https://github.com/PabloMessina/Competitive-Programming-Material
-*Description:* Flow algorithm with complexity  $O (|E| dot |V|^2)$
-*Status:* Not tested
+ *Author:* Pablo Messina
+ *Source:* https://github.com/PabloMessina/Competitive-Programming-Material
+ *Description:* Flow algorithm with complexity  $O (|E| dot |V|^2)$
+ *Status:* Not tested
 */
 template<class T>
 struct Dinic {

content/graphs/flow-matching/hlpp.cpp

@@ -1,7 +1,7 @@
 /*
-*Author:* Abner Vidal
-*Description:* Flow algorithm with complexity  $O (|V|^2 dot sqrt(|E|))$
-*Status:* Tested on CSES
+ *Author:* Abner Vidal
+ *Description:* Flow algorithm with complexity  $O (|V|^2 dot sqrt(|E|))$
+ *Status:* Tested on CSES
 */
 template<class T>
 struct hlpp {

content/graphs/flow-matching/min-cut.cpp

@@ -1,7 +1,7 @@
 /*
-*Author:* Abner Vidal
-*Description:* Recovers the min-cut after running a max flow algorithm.
-*Status:* Tested on codeforces
+ *Author:* Abner Vidal
+ *Description:* Recovers the min-cut after running a max flow algorithm.
+ *Status:* Tested on codeforces
 */
 template<class Edge>
 vector<array<int,2>> min_cut(int s, vector<vector<Edge>> &G){

content/graphs/flow-matching/push-relabel.cpp

@@ -1,7 +1,7 @@
 /*
-*Author:* Abner Vidal
-*Description:* Flow algorithm with complexity  $O (|E| dot |V|^2)$
-*Status:* Tested on CSES
+ *Author:* Abner Vidal
+ *Description:* Flow algorithm with complexity  $O (|E| dot |V|^2)$
+ *Status:* Tested on CSES
 */
 template<class T>
 struct push_relabel {