The structure of a graph is a data structure in which there may be a certain relationship between any two data objects. The data structure is a collection of data elements with structural characteristics. It studies the logical structure of the data. and the physical structure of data and the relationships between them, and define operations suitable for this structure and design corresponding algorithms.
Graph
The structure of the graph is that there may be a certain relationship between any two data objects. data structure.
Related introduction:
Data structure (data structure) is a collection of data elements with structural characteristics. It studies the logical structure of data and the physical structure of data and the relationship between them. Interrelationships, define appropriate operations for this structure, design corresponding algorithms, and ensure that the new structure obtained after these operations still maintains the original structure type. In short, a data structure is a collection of data elements that have one or more specific relationships with each other, that is, a collection of data elements with a "structure". "Structure" refers to the relationship between data elements, which is divided into logical structure and storage structure.
The logical structure and physical structure of data are two closely related aspects of data structure. The same logical structure can correspond to different storage structures. The design of the algorithm depends on the logical structure of the data, and the implementation of the algorithm depends on the specified storage structure.
The research content of data structure is the basis for constructing complex software systems, and its core technology is decomposition and abstraction. Through decomposition, three levels of data can be divided; through abstraction, the specific content of the data elements is discarded, and the logical structure is obtained. Similarly, operations are defined by decomposing processing requirements into functions and discarding implementation details through abstraction. The combination of the above two aspects can transform the problem into a data structure. This is a process from concrete (that is, concrete problems) to abstract (that is, data structures). Then, by adding consideration to the implementation details, the storage structure and implementation operations are further obtained to complete the design task. This is a process from abstract (i.e. data structure) to concrete (i.e. specific implementation).
The above is the detailed content of What is the structure of the graph?. For more information, please follow other related articles on the PHP Chinese website!