摘要： This paper is divided into two parts, where the general regularities of information flow in the tree graph are discussed. In the first part we discuss the equivalent theorems of the tree flow, the main sections are as follows:1. fundamental definitions; 2. equivalent mapping structure; 3. equivalent partition of vector set F*; 4. theorems of tree flow. And in the second part we put stress on the establishment of tree flow equations.