官术网_书友最值得收藏!

The structure of a Mathematical Tree

Alright, it's time to understand how a Behavior Tree works. First of all, as the name suggests, it is a tree, mathematical speaking.

If you are interested to learn more about trees in graph theory, you can consult the following Wikipedia page: https://en.wikipedia.org/wiki/Tree_(graph_theory). Alternatively, if you want to get even more technical, you can consult the following page:  http://mathworld.wolfram.com/Tree.html. However, the definitions that are found at both the links are pretty mathematical, and you don't need them to understand Behavior Trees. 

It is important to specify that a (mathematical) tree expresses relationships between nodes. In this sense, the same relationship that describes a family (e.g. parent, child, sibling) has been adopted in technical terms. To simplify the understanding of a tree, you can imagine your genealogical tree: each node is a person, and the branches (that connect people) are the relationships between the various people. However, the structure is still slightly different.

So, what is a tree? It is a graph that describes relationships between different nodes.

In particular, there is a "Root" node, which is the only node without a parent. From there, every node can have one or more children, but only one parent. The end nodes, which are the ones that do not have any child, are called leaves. Here is a simple diagram to help you understand the basic structure of a Mathematical Tree in general:

It might sound complicated, but it really isn't. Things will start getting interesting as we move on and talk about BehaviorTrees.

主站蜘蛛池模板: 易门县| 儋州市| 荔浦县| 新乡县| 长阳| 鹤峰县| 北安市| 施秉县| 巴彦淖尔市| 剑河县| 湖州市| 黄龙县| 武平县| 三穗县| 高邑县| 赤城县| 都兰县| 阳城县| 都昌县| 萍乡市| 常熟市| 九江县| 岱山县| 枞阳县| 岳西县| 深州市| 裕民县| 聂拉木县| 扶风县| 宜宾县| 吴川市| 安康市| 通江县| 太和县| 彩票| 三台县| 平度市| 襄垣县| 大姚县| 宁陵县| 永和县|