2022-10-14 12:53:31 +02:00
|
|
|
from manim import *
|
|
|
|
|
|
|
|
import networkx as nx
|
|
|
|
|
|
|
|
class Tree(Scene):
|
|
|
|
def construct(self):
|
2022-10-14 21:38:22 +02:00
|
|
|
n = 2**6
|
|
|
|
vertices = list(range(1, 2*n))
|
|
|
|
edges = [(v // 2, v) for v in vertices[1:]]
|
2022-10-14 12:53:31 +02:00
|
|
|
|
2022-10-14 21:38:22 +02:00
|
|
|
#graph_vis = Graph(vertices, edges, labels=True, layout="tree", layout_config={"vertex_spacing": (1.0, 1.0)}, root_vertex=1)
|
|
|
|
graph_vis = Graph(vertices, edges, labels=False, layout="tree", layout_config={"vertex_spacing": (.2, 1.1)}, root_vertex=1)
|
|
|
|
|
|
|
|
self.play(Create(graph_vis))
|
|
|
|
|
|
|
|
def query(v, tl, tr, ql, qr):
|
|
|
|
if tr <= ql or qr <= tl:
|
|
|
|
if v != 1:
|
|
|
|
graph_vis.edges[(v // 2, v)].color = RED
|
|
|
|
self.play(Indicate(graph_vis[v], color=RED))
|
|
|
|
return
|
|
|
|
if ql <= tl and tr <= qr:
|
|
|
|
if v != 1:
|
|
|
|
graph_vis.edges[(v // 2, v)].color = BLUE
|
|
|
|
self.play(Indicate(graph_vis[v], color=BLUE))
|
|
|
|
return
|
|
|
|
|
|
|
|
if v!= 1:
|
|
|
|
graph_vis.edges[(v // 2, v)].color = PURPLE
|
|
|
|
graph_vis[v].color = PURPLE
|
|
|
|
self.play(Indicate(graph_vis[v], color=YELLOW))
|
|
|
|
|
|
|
|
m = (tl + tr) // 2
|
|
|
|
query(2*v, tl, m, ql, qr)
|
|
|
|
query(2*v+1, m, tr, ql, qr)
|
|
|
|
|
|
|
|
|
|
|
|
query(1, 0, n, 42, 59)
|
2022-10-14 12:53:31 +02:00
|
|
|
self.wait(2)
|