How to determine a chart is sparse or densely involved in some algorithms, discovering the use of quite wide, such as logistics distribution, Chinese word, and even courses can be expressed and calculated. No matter which use choice is essential. There are two main representations: adjacent matrices and adjacent tables.
Decides that we use an adjacency matrix or an adjacent table to represent a picture, it is necessary to judge that a picture is a sparse map or a dense figure. The adjacent matrix and the adjacent table indicate that the storage space and algorithm time required for the figure are very different, so it is very important to determine that a picture is sparse or dense.
The judgment criteria are as follows: Suppose one of the n nodes of Fig. G = (V, e), and the exit of each node of Figure G is a fixed constant: k. Since E = KV = O (V), we refer to a scarner figure that meets the E = O (V) condition. Similarly: If a plural g = (v, e) has n nodes, it is assumed that each node of Figure G is a decimal number of N, and 0 It is said that the neighboring table is the standard method of the diagram, because the dense map is not very common in practical applications.
