vis 绘制二叉树

96 阅读 0 评论 64 点赞

我是靠谱客的博主哭泣身影，这篇文章主要介绍vis 绘制二叉树，现在分享给大家，希望可以做个参考。

原文链接: vis 绘制二叉树

上一篇: vis 入门

下一篇: python常用库

使用vis 绘制二叉树

复制代码

<!DOCTYPE html>
<html lang="en">
<head>
    <meta charset="UTF-8">
    <link rel="stylesheet" href="css/uikit.min.css">
    <link rel="stylesheet" href="css/bootstrap.min.css">
    <title>迷宫寻路</title>
    <script src="js/jquery-3.2.1.js"></script>
    <script src="js/bootstrap.js"></script>
    <script src="js/vue.js"></script>
    <script src="js/uikit.min.js"></script>
    <script src="js/maze.js"></script>
    <script src="js/vue-router.js"></script>
    <script src="js/moment-with-locales.js"></script>
    <script src="js/vis/vis.js"></script>
    <link href="js/vis/vis-network.min.css" rel="stylesheet" type="text/css"/>

</head>
<body>
<div class="container">
    <div id="mynetwork" style="width: 1200px;height: 800px;border: 1px solid lightgrey"></div>
</div>

function pow(x, y) {
        if (y == 0)
            return 1
        let ans = 1
        while (y-- && y > 0)
            ans *= x
        return ans
    }

//                0
    //             1      2
    //           3  4   5  6
    var height = 60    //树的层高
    var width = 30      //树最下层节点相邻的距离
    var level = getLevel(head)  //树的最大层高,根节点在第一层
    var nodes = []
    var edges = []

//    x右,y下
    //递归遍历,设置节点和距离
    function dfs(h, lv) {
        if (h == null)
            return
        console.log('h.x:' + h.x)
        console.log('h.y:' + h.y)
        if (h.left != null) {
            h.left.y = h.y + height
            h.left.x = h.x - pow(2, level - lv - 1) * width
            nodes.push({
                id: h.left.val, label: '' + h.left.val, x: h.left.x, y: h.left.y
            })
//            nodes.push({
//                    id: h.left.val, label: '' + h.left.val, x: h.left.x, y: h.left.y,
//                    fixed: {x: true, y: true}
//                    fixed: {x: true, y: false}

edges.push({from: h.val, to: h.left.val, arrows: 'to'})
            dfs(h.left, lv + 1)
        }
        if (h.right != null) {
            h.right.y = h.y + height
            h.right.x = h.x + pow(2, level - lv - 1) * width

nodes.push({
                id: h.right.val, label: '' + h.right.val, x: h.right.x, y: h.right.y,
            })
//            nodes.push({
//                id: h.right.val, label: '' + h.right.val, x: h.right.x, y: h.right.y,
//                fixed: {x: true, y: true}})
//                fixed: {x: true, y: false}
//            })

edges.push({from: h.val, to: h.right.val, arrows: 'to'})
            dfs(h.right, lv + 1)
        }
    }

function draw() {
        var head = create() //获取一棵树

if (head == null)
            return
        level = getLevel(head)
        nodes.push({id: head.val, label: '' + head.val, x: 0, y: 0, fixed: {x: false, y: false}})
//        nodes.push({id: head.val, label: '' + head.val, x: 0, y: 0, fixed: {x: true, y: false}})

head.x = 0
        head.y = 0
        dfs(head, 1)
        for (let i in nodes)
            console.log(nodes[i])

for (let i in edges)
            console.log(edges[i])

var container = document.getElementById('mynetwork');
        var data = {
            nodes: nodes,
            edges: edges
        };
        var options = {
            nodes: {
                shape: 'circle',
            },
            physics: {
                enabled: false,
            }

};
        network = new vis.Network(container, data, options);
    }

function Node(val = 0, left = null, right = null) {
        this.val = val
        this.left = left
        this.right = right
    }

function create() {
        var head = new Node(0)
        head.left = new Node(1)
        head.right = new Node(2)
        head.left.left = new Node(3)
        head.left.right = new Node(4)
        head.right.left = new Node(5)
        head.right.right = new Node(6)
        head.right.right.left = new Node(7)
        head.right.right.right = new Node(8)
        head.right.right.left.left=new Node(9)
        return head
    }

//中序递归遍历数树
    function show(head) {
        console.log(head)
        if (head != null) {
            console.log(head.val)
            show(head.left)
            show(head.right)
        }

}

//获取树高
    function getLevel(head) {
        if (head == null) return 0

var maxLevel = 1

//根节点在第1层
        dfs(head, 1)

function dfs(h, lv) {
            if (h != null) {
                maxLevel = Math.max(lv, maxLevel)
                dfs(h.left, lv + 1)
                dfs(h.right, lv + 1)
            }
        }

return maxLevel
    }

var head = create()
    console.log(pow(2, 10))
    draw()
</script>
</body>
</html>

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
<!DOCTYPE html>
<html lang="en">
<head>
    <meta charset="UTF-8">
    <link rel="stylesheet" href="css/uikit.min.css">
    <link rel="stylesheet" href="css/bootstrap.min.css">
    <title>迷宫寻路</title>
    <script src="js/jquery-3.2.1.js"></script>
    <script src="js/bootstrap.js"></script>
    <script src="js/vue.js"></script>
    <script src="js/uikit.min.js"></script>
    <script src="js/maze.js"></script>
    <script src="js/vue-router.js"></script>
    <script src="js/moment-with-locales.js"></script>
    <script src="js/vis/vis.js"></script>
    <link href="js/vis/vis-network.min.css" rel="stylesheet" type="text/css"/>
    <!--<script src="js/sigma.js"></script>-->

</head>
<body>
<div class="container">
    <div id="mynetwork" style="width: 1200px;height: 800px;border: 1px solid lightgrey"></div>
</div>

<script>

    function pow(x, y) {
        if (y == 0)
            return 1
        let ans = 1
        while (y-- && y > 0)
            ans *= x
        return ans
    }

    //                0
    //             1      2
    //           3  4   5  6
    var height = 60    //树的层高
    var width = 30      //树最下层节点相邻的距离
    var level = getLevel(head)  //树的最大层高,根节点在第一层
    var nodes = []
    var edges = []

    //    x右,y下
    //递归遍历,设置节点和距离
    function dfs(h, lv) {
        if (h == null)
            return
        console.log('h.x:' + h.x)
        console.log('h.y:' + h.y)
        if (h.left != null) {
            h.left.y = h.y + height
            h.left.x = h.x - pow(2, level - lv - 1) * width
            nodes.push({
                id: h.left.val, label: '' + h.left.val, x: h.left.x, y: h.left.y
            })
//            nodes.push({
//                    id: h.left.val, label: '' + h.left.val, x: h.left.x, y: h.left.y,
//                    fixed: {x: true, y: true}
//                    fixed: {x: true, y: false}


            edges.push({from: h.val, to: h.left.val, arrows: 'to'})
            dfs(h.left, lv + 1)
        }
        if (h.right != null) {
            h.right.y = h.y + height
            h.right.x = h.x + pow(2, level - lv - 1) * width

            nodes.push({
                id: h.right.val, label: '' + h.right.val, x: h.right.x, y: h.right.y,
            })
//            nodes.push({
//                id: h.right.val, label: '' + h.right.val, x: h.right.x, y: h.right.y,
//                fixed: {x: true, y: true}})
//                fixed: {x: true, y: false}
//            })

            edges.push({from: h.val, to: h.right.val, arrows: 'to'})
            dfs(h.right, lv + 1)
        }
    }

    function draw() {
        var head = create() //获取一棵树

        if (head == null)
            return
        level = getLevel(head)
        nodes.push({id: head.val, label: '' + head.val, x: 0, y: 0, fixed: {x: false, y: false}})
//        nodes.push({id: head.val, label: '' + head.val, x: 0, y: 0, fixed: {x: true, y: false}})

        head.x = 0
        head.y = 0
        dfs(head, 1)
        for (let i in nodes)
            console.log(nodes[i])

        for (let i in edges)
            console.log(edges[i])


        var container = document.getElementById('mynetwork');
        var data = {
            nodes: nodes,
            edges: edges
        };
        var options = {
            nodes: {
                shape: 'circle',
            },
            physics: {
                enabled: false,
            }

        };
        network = new vis.Network(container, data, options);
    }

    function Node(val = 0, left = null, right = null) {
        this.val = val
        this.left = left
        this.right = right
    }

    function create() {
        var head = new Node(0)
        head.left = new Node(1)
        head.right = new Node(2)
        head.left.left = new Node(3)
        head.left.right = new Node(4)
        head.right.left = new Node(5)
        head.right.right = new Node(6)
        head.right.right.left = new Node(7)
        head.right.right.right = new Node(8)
        head.right.right.left.left=new Node(9)
        return head
    }

    //中序递归遍历数树
    function show(head) {
        console.log(head)
        if (head != null) {
            console.log(head.val)
            show(head.left)
            show(head.right)
        }

    }

    //获取树高
    function getLevel(head) {
        if (head == null) return 0

        var maxLevel = 1

        //根节点在第1层
        dfs(head, 1)

        function dfs(h, lv) {
            if (h != null) {
                maxLevel = Math.max(lv, maxLevel)
                dfs(h.left, lv + 1)
                dfs(h.right, lv + 1)
            }
        }

        return maxLevel
    }

    var head = create()
    console.log(pow(2, 10))
    draw()
</script>
</body>
</html>