Tree Diagram Designer's computing power
the weather can be predicted by predicting the trend of all the air particles in the world. Nominally, it is used to analyze the meteorological data (the ultra-high speed parallel calculus processor that can simulate the air change at high speed on the molecular scale, and simulate the weather of one month in the calculation neutral gear), but in reality, it is used to calculate the results of research experiments, such as drug reaction, physiological reaction, and so on Electronic reaction and so on, everything can be calculated by the "tree diagram designer". In order to resist foreign enemies, the tree map designer was placed on the satellite "Vega-1" launched by Xueyuan city
once a month, there will be a complete prediction of the actions of all the air particles on the earth, calculating the weather in one month at a time, while other days will be used to predict many studies in the garden city. Hundreds of applications are sent to "tree designers" every day
at 00:22 on July 28, the "tree map designer" on the satellite orbit was destroyed by "Dragon King's sigh" by indix in "automatic Secretary" mode“ The wreckage of the "tree designer" is floating in outer space. At 01:15 on the same day, the first search team of Xueyuan city was dispatched. Part of the wreckage was recovered at 21:40 on July 30. However, in order to maintain the reputation of Xueyuan City, the upper level of Xueyuan city announced to the ordinary people that Vega-1 was still operating normally
in August, the core remains of the "tree designer" were recovered. On September 14, the "Wreckage" of the main calculus center of the "tree map designer" was secretly transported back to Xueyuan City, but it was snatched by jiebiao Danxi and finally destroyed by one party
imaginary number school district & 8231; The primary knowledge is generally regarded as the original research institute of the garden city. It is rumored that it is the organization that secretly dominates the garden city, while the external churches and magicians believe that it is the "building without doors and windows" where aresta lives. In fact, the aim diffusion force field released by 2.3 million people with ability overlaps, so the control is very difficult, and no one can control it at present. Power will grow explosively because of the impact of certain power, but the critical point, mode and scale have not yet been understood. He didn't know how to think and didn't have consciousness, but under the deliberate guidance of aresta, consciousness came into being, that is, wind cutting Binghua. Aresta wants to use this to create an "artificial universe."
it's right to say what you're looking for is useless
in volume 8, the wreckage was recovered by the space shuttle launched by xueyuan, but it fell into the hands of jiebiao Danxi, and finally was completely destroyed by one party.
is also called dendrogram. In order to show the genetic relationship by graph, the taxon is placed on the top of the branch on the graph. According to the branch, the relationship can be expressed, which has two-dimensional and three-dimensional. In quantitative taxonomy, the dendrogram used for phenotypic classification is called phenogram, and the dendrogram incorporated with systematic inference is called cladogram. The phenotypic dendrogram is based on population analysis, and the systematic dendrogram is based on a simulated hypothetical evolutionary direction of traits, i.e. described by computer.
Dendrogram is also called dendrogram. In order to show the genetic relationship by graph, the taxon is placed on the top of the branch on the graph. According to the branch, the relationship can be expressed, which has two-dimensional and three-dimensional. In quantitative taxonomy, the dendrogram used for phenotypic classification is called phenogram, and the dendrogram incorporated with systematic inference is called cladogram. The phenotypic dendrogram is based on population analysis, and the systematic dendrogram is based on a simulated hypothetical evolutionary direction of traits, i.e. described by computer
tree diagram is generally used for extended analysis. Looking for customers or suppliers in the future can provide all aspects of help, benefits.
The operation steps of the example are as follows:
1. First open the word document, and then click the "SmartArt" option in the "insert" menu
in order to show the genetic relationship by graph, the taxon is placed on the top of the branch on the graph, and the relationship can be expressed by the branch, which has two-dimensional and three-dimensional. In quantitative taxonomy, the dendrogram used for phenotypic classification is called phenogram, and the dendrogram incorporated with systematic inference is called cladogram. The phenotypic dendrogram is based on population analysis, and the systematic dendrogram is based on a simulated hypothetical evolutionary direction of traits, i.e. described by computer
the tree diagram is also a kind of graph that junior high school students need to draw to learn probability problems<
how to draw a tree graph
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 minimum. The first algorithm of minimum tree graph is O (VE) algorithm proposed by Zhu Yongjin and Liu Zhenhong in 1965
the method of judging whether there is a tree graph is very simple. It only needs to traverse the graph once with V as the root, so the following algorithm does not consider the case that the tree graph does not exist
before all operations start, we need to clear all self loops in the graph. Obviously, self rings can't be on any tree. Only after this operation can the complexity of the algorithm be guaranteed to be o (VE)
first, select an entry edge for each point except the root, which must be the smallest of all the entry edges. Now all the minimum input edges are selected. If there is no directed ring in the input edge set, we can prove that the set is the minimum tree of the graph. It's not that hard to prove. If there is a directed ring, we need to call it an artificial vertex and change the weight of the edge in the graph. Suppose that a point u is on the ring and the weight of the edge pointing to u in the ring is in [u], then for each edge (U, I, w) starting from u, connect the edges of (new, I, w) in the new graph, where new is the newly added artificial vertex; For each edge (I, u, w) entering u, the edge of edge (I, new, w-in [u]) is established in the new graph. Why should I subtract in [u] from the weight of the input edge? This will be explained later. The steps of the algorithm are given here. Then it can be proved that the sum of the weight of the smallest tree graph in the new graph and the weight of the shrinking ring in the old graph is the weight of the smallest tree graph in the original graph
the above conclusion is not proved. Now, according to the above conclusion, we will explain why the weight of the outgoing edge is unchanged, and the weight of the incoming edge is subtracted by in [u]. For the minimum tree graph t in the new graph, let the edge pointing to the artificial node be e. After expanding the artificial node, e points to a ring. Suppose that e points to u, then we delete the edge in [u] on the ring pointing to u, and we get a tree graph in the original graph. We will find that if the weight of E in the new graph W & # 39 e) If the weight W (E) of E in the original graph subtracts the weight in [u], then when we delete in [u] and restore e to the original graph state, the weight of the tree graph is still the weight of the new tree graph plus the weight of the ring, and this weight is exactly the weight of the smallest tree graph. So after expanding the nodes, we still get the minimum tree graph. Expand all the artificial nodes step by step to get the minimum tree of the initial graph
if the implementation is very smart, we can find the minimum entry edge o (E), find the ring O (V), and shrink o (E), in which we need a little skill to find the ring O (V). So the complexity of each contraction is O (E), and then how many times at most? Since we have removed all self rings at the beginning, we can know that each ring contains at least 2 points. After shrinking to 1 point, the total number of points decreases by at least 1. When the whole graph shrinks to only one point, the minimum tree graph is not needed. So we can only do V-1 contraction at most, so the total complexity is naturally o (VE). Thus, if the self loops are not removed at the beginning, the theoretical complexity will be related to the number of self loops.