绘制递归树

最新推荐文章于 2024-02-02 14:34:41 发布

yaqiangwang

最新推荐文章于 2024-02-02 14:34:41 发布

阅读量254

点赞数

文章标签：算法开源软件信息可视化

本文链接：https://blog.csdn.net/yaqiangwang/article/details/128501477

版权

脚本：

def f(x, y, d, R, n, N):
    if n < N:
        b = zeros(3)
        if n > 3:
            b = [.5,.2,.6]

        X = R * sin(np.deg2rad(d)) + x
        Y = R * cos(np.deg2rad(d)) + y
        plot(X, Y, color=b, linewidth=np.linalg.norm(R)/15)
        A = array([0,-48,-25,43,31])
        for i in range(1, 5):
            r = (i + 1) % 2
            L = .58 + r * .07
            f(X[i], Y[i], d+A[i], L*R, n+1, 7-r)

ax = axes(outerposition=[0,0,1,1], axis=False)
f(0, 0, array([0,0,-5.76,0,6.58,0]), array([0,55,99,55,105,55]), 0, 1)