Remove duplicate label `H`

Overlap/Analysis/report_graph.py

@@ -118,52 +118,51 @@ if __name__ == "__main__":
     args = parser.parse_args()
 
     G = read_eddy_graph(args.edgelist_file)
-    H = G
-    len_H = len(H)
-    print("Number of nodes:", len_H)
+    len_G = len(G)
+    print("Number of nodes:", len_G)
     print(
         "(This should be the number of eddies minus the number of isolated "
         "nodes.)"
     )
-    print("Number of edges:", H.number_of_edges())
+    print("Number of edges:", G.number_of_edges())
     print(
         "Number of weakly connected components:",
-        nx.number_weakly_connected_components(H),
+        nx.number_weakly_connected_components(G),
     )
-    n1 = len_H
-    n2 = len_H
+    n1 = len_G
+    n2 = len_G
 
-    if len_H >= 1:
+    if len_G >= 1:
         # First and last dates:
-        node_index = min(H.nodes)
+        node_index = min(G.nodes)
         my_date = util_eddies.node_to_date_eddy(
-            node_index, H.graph["e_overestim"], only_date=True
+            node_index, G.graph["e_overestim"], only_date=True
         )
         print("First date:", my_date)
-        node_index = max(H.nodes)
+        node_index = max(G.nodes)
         my_date = util_eddies.node_to_date_eddy(
-            node_index, H.graph["e_overestim"], only_date=True
+            node_index, G.graph["e_overestim"], only_date=True
         )
         print("Last date:", my_date)
 
     if args.merging:
         print("\nMerging:")
 
-    for n, d in H.in_degree():
+    for n, d in G.in_degree():
         if d >= 1:
             n2 -= 1
             if args.merging and d >= 2:
-                print(list(H.predecessors(n)), "->", n)
+                print(list(G.predecessors(n)), "->", n)
 
     if args.merging:
         print("---")
         print("Splitting:")
 
-    for n, d in H.out_degree():
+    for n, d in G.out_degree():
         if d >= 1:
             n1 -= 1
             if args.merging and d >= 2:
-                print(n, "->", list(H.successors(n)))
+                print(n, "->", list(G.successors(n)))
 
     if args.merging:
         print("---")
@@ -172,7 +171,7 @@ if __name__ == "__main__":
     print("Number of roots:", n2)
 
     if args.gv:
-        A = nx_agraph.to_agraph(H)
-        partition_graph_date(A, H.graph["e_overestim"])
+        A = nx_agraph.to_agraph(G)
+        partition_graph_date(A, G.graph["e_overestim"])
         A.write("eddy_graph.gv")
         print('Created file "eddy_graph.gv".')