Update app.py

app.py

@@ -39,37 +39,11 @@ def create_binary_tree_edges(depth):
     return edges
 
 
-# def create_binary_tree_edges(depth):
-#     edges = []
-#     current_index = 0  # Start with the root node
-    
-#     # For each level of depth until the desired depth
-#     for level in range(depth):
-#         # Calculate the number of nodes at this level
-#         level_nodes = 2 ** level
-        
-#         # For each node at this level, create edges to its two children
-#         for i in range(level_nodes):
-#             left_child_index = current_index + level_nodes
-#             right_child_index = current_index + level_nodes + 1
-#             edges.append((current_index, left_child_index))
-#             edges.append((current_index, right_child_index))
-#             current_index += 1
-            
-#         # The current index is now at the next level, so increase by the number of nodes at this level
-#         current_index += level_nodes
-        
-#     return edges
-
-# # Create edges for a binary tree with depth of 6
-# binary_tree_edges = create_binary_tree_edges(6)
-# binary_tree_edges
-
 
 def plot_tree_using_igraph():
     # Define the edges in a tree structure
     # edges = [(0, 1), (0, 2), (1, 3), (1, 4), (2, 5), (2, 6)]
-    edges = create_binary_tree_edges(6)
+    edges = create_binary_tree_edges(8)
     # edges = [(str(n1), str(n2)) for (n1, n2) in edges]
 
     print(edges)