2. Then draw multiple branches and repeat several times.
3. Finally, write down the corresponding name on each branch.
Summary:
The 1. tree diagram is a graphical representation of the data tree, and the objects are organized in a parent-child hierarchy. Is an expression of enumeration. Tree diagram is also a kind of graph that junior high school students need to draw for learning probability problems.
2. The minimum tree graph is to specify a special point V in the directed weighted graph and find a directed spanning tree T, so that the root of the directed tree is V and the total weight of all edges in T is the minimum. The first algorithm of the minimum tree graph is the algorithm with O(VE) proposed by Zhu and Liu in 1965. The method of judging whether there is a tree graph is very simple, just need to traverse the graph once with V as the root.