#170 __repr__ is used to make the code cleaner

Author: Hamid Gasmi

06-dynamic-programming-applications-in-machine-learning-and-genomics/1-sequence-alignment-1/longest_path_dag_bfs.py

@@ -101,10 +101,10 @@ def longest_path_bfs(self, source, sink):
         self.longest_path_len = max_distance[sink_vertex].dist
         self.longest_path = self.longest_path_backtrack(sink_vertex, max_distance)
 
-    def longest_path_to_str(self):
-
-        return '->'.join(self.longest_path)
+    def __repr__(self):
 
+        return f"{self.longest_path_len} \n" + '->'.join(self.longest_path)
+    
 if __name__ == "__main__":
 
     source = int(sys.stdin.readline().strip())
@@ -113,6 +113,6 @@ def longest_path_to_str(self):
 
     dag = Directed_Acyclic_Graph(source, sink, edges)
     dag.longest_path_bfs(source, sink)
+    
+    print(dag)
 
-    print(dag.longest_path_len)
-    print(dag.longest_path_to_str())

06-dynamic-programming-applications-in-machine-learning-and-genomics/1-sequence-alignment-1/longest_path_dag_topological_order.py

@@ -119,9 +119,9 @@ def compute_longest_path(self):
         self.longest_path_len = max_distance[sink_vertex].dist
         self.longest_path = self.longest_path_backtrack(sink_vertex, max_distance)
 
-    def longest_path_to_str(self):
+    def __repr__(self):
 
-        return '->'.join(self.longest_path)
+        return f"{self.longest_path_len} \n" + '->'.join(self.longest_path)
 
 if __name__ == "__main__":
 
@@ -131,6 +131,5 @@ def longest_path_to_str(self):
 
     dag = Directed_Acyclic_Graph(source, sink, edges)
     dag.compute_longest_path()
-
-    print(dag.longest_path_len)
-    print(dag.longest_path_to_str())
+    
+    print(dag)