Update app.py
Browse files
app.py
CHANGED
@@ -91,10 +91,13 @@ def create_binary_tree_edges(root):
|
|
91 |
while len(prev) > 0:
|
92 |
new_prev = []
|
93 |
for node in prev:
|
94 |
-
edges
|
95 |
-
new_prev
|
96 |
prev = new_prev
|
97 |
|
|
|
|
|
|
|
98 |
return edges
|
99 |
|
100 |
def plot_tree_using_igraph():
|
@@ -105,7 +108,7 @@ def plot_tree_using_igraph():
|
|
105 |
edges = create_binary_tree_edges(root)
|
106 |
# edges = [(str(n1), str(n2)) for (n1, n2) in edges]
|
107 |
|
108 |
-
print(edges)
|
109 |
|
110 |
# Create an igraph Graph from the edge list
|
111 |
g = ig.Graph(edges, directed=True)
|
|
|
91 |
while len(prev) > 0:
|
92 |
new_prev = []
|
93 |
for node in prev:
|
94 |
+
edges = edges + [(node.id, child.id) for child in node.children]
|
95 |
+
new_prev = new_prev + [child for child in node.children if (len(child.children) > 0)]
|
96 |
prev = new_prev
|
97 |
|
98 |
+
print(edges)
|
99 |
+
print('-*'*20, '\n')
|
100 |
+
|
101 |
return edges
|
102 |
|
103 |
def plot_tree_using_igraph():
|
|
|
108 |
edges = create_binary_tree_edges(root)
|
109 |
# edges = [(str(n1), str(n2)) for (n1, n2) in edges]
|
110 |
|
111 |
+
# print(edges)
|
112 |
|
113 |
# Create an igraph Graph from the edge list
|
114 |
g = ig.Graph(edges, directed=True)
|