A scalable mesh topology linked list data structure

Abstract

The application discloses an extensible mesh linked list data structure, and belongs to the field of computer data structure. In view of the limitations of traditional static arrays and linear linked lists in scalability and topological relation maintenance, the application proposes a novel dynamic two-dimensional topological data structure, four direction pointers (up, down, left and right) are explicitly configured for each node, efficient insertion, deletion and traversal operations of data nodes are realized, and the order and topological integrity of data are ensured. The application is especially suitable for mesh and network data organization scenes such as extensible representation of the periodic table of elements. Experimental results show that the structure is excellent in dynamic updating and topological integrity maintenance.

Description

Technical Field

[0001] This invention relates to the field of computer data structure technology, specifically to an extensible mesh linked list data structure, suitable for the efficient organization and management of mesh and network data. Background Technology

[0002] In computer science, traditional data structures such as static arrays and linear linked lists are widely used for data storage and management. However, they have significant limitations when processing two-dimensional grid-like or network-like data: static arrays require pre-allocated storage space, resulting in high expansion costs and an inability to flexibly adapt to dynamic data changes; linear linked lists only support unidirectional or bidirectional linear connections, making it difficult to maintain topological relationships in two-dimensional space, leading to low efficiency in accessing neighboring nodes and failing to meet the requirements of order and integrity for grid-like data. Existing technologies cannot simultaneously address dynamic scalability and topological relationship maintenance when processing scenarios such as the periodic table, biological networks, and graphical grids. Therefore, a novel two-dimensional topological data structure is urgently needed to solve these problems. Summary of the Invention

[0003] The purpose of this invention is to overcome the shortcomings of existing technologies and provide a scalable grid-based linked list data structure. By configuring each node with four pointers (up, down, left, and right), it achieves efficient dynamic updating and topological integrity maintenance of two-dimensional grid-like data. This invention includes several grid nodes, each containing a data field and a four-way pointer field. The two-dimensional grid topology is constructed through pointer connections, supporting dynamic insertion, deletion, and traversal operations, while maintaining data order and topological integrity after updates. Compared with existing technologies, this invention has advantages such as strong dynamic scalability, high topological integrity, and excellent operational efficiency, and can be widely applied in fields such as scalable representation of the periodic table, biological network modeling, and graphics processing. Detailed Implementation

[0004] The grid node structure of this invention is defined as follows: each node contains a data field and four explicitly configured pointer fields (up, down, left, and right). The pointer fields of boundary nodes are initialized to null values. During dynamic insertion, a new node is inserted in any direction of a specified node, and the pointers of adjacent nodes are updated to maintain the connection. During dynamic deletion, a specified node is removed, and the pointers of its adjacent nodes are reconnected to fill the gap and maintain the integrity of the structure. Traversal operations support both row-first and column-first modes, allowing all nodes to be accessed sequentially in a specified direction. Attached Figure Description

[0005] Figure 1 is a schematic diagram of the node structure of the grid topology linked list of the present invention. The node includes a data field and four pointer fields: up, down, left, and right. In the initial state, all pointer fields are null. Figure 2 is a schematic diagram of the topological organization of the grid topological linked list of the present invention, showing the two-dimensional topological layout of a 3×4 grid; Figure 3 is a schematic diagram of the node insertion target position selection in the grid topology linked list of the present invention, with the target node of the insertion operation marked in orange. Figure 4 illustrates the pointer update for inserting nodes in the mesh topology linked list according to the present invention. Figure 1 This demonstrates the operations of updating the right pointer of the target node and configuring the left pointer of the new node. Figure 5 illustrates the pointer update for inserting nodes in the mesh topology linked list according to the present invention. Figure 2 This demonstrates the operations of updating the left pointer of the target node's right neighbor and configuring the right pointer of the new node. Figure 6 illustrates the pointer update for inserting nodes in the mesh topology linked list according to the present invention. Figure 3 This demonstrates the operations of setting the downward pointer of the adjacent node above and the upward pointer of the new node; Figure 7 illustrates the pointer update for inserting nodes in the mesh topology linked list according to the present invention. Figure 4 This demonstrates the operations of setting a new node's down pointer and its lower neighbor's up pointer; Figure 8 is a schematic diagram of the topology maintenance of the mesh topology linked list node insertion of the present invention, showing the operation of traversing the column downward from the lower neighbor node and correcting the topology relationship; Figure 9 is a schematic diagram of the node deletion target position selection in the grid topology linked list of the present invention, with the node to be deleted (del_node) marked in red. Figure 10 illustrates the pointer modification for deleting nodes in the mesh topology linked list according to the present invention. Figure 1 This demonstrates the initial modification operations on the pointers surrounding the node to be deleted; Figure 11 illustrates the pointer modification for deleting nodes in the mesh topology linked list according to the present invention. Figure 2 This demonstrates the operation of updating the right pointer of the left neighbor node and the left pointer of the right neighbor node of the node to be deleted; Figure 12 is a schematic diagram of topology maintenance for deleting nodes in the grid topology linked list of the present invention, showing the operation of traversing columns downward from the lower neighboring nodes and correcting the topology relationship; Figure 13 is a schematic diagram of the vertical connection for deleting nodes in the grid topology linked list of the present invention, showing the operation of establishing a vertical connection between the last node of the column and its upper and lower neighboring nodes.

Claims

1. A scalable grid-topology linked list data structure, characterized in that, include: Several grid nodes, each containing a data field and four explicitly configured pointer fields for the up, down, left, and right directions; The direction pointer field is used to connect adjacent nodes in the same row or column to construct a two-dimensional grid-like topology. The grid topology linked list supports dynamic insertion and deletion of data nodes, and maintains the orderliness and topological integrity of the data after the update operation.

2. The grid topology linked list data structure according to claim 1, characterized in that, The four direction pointer fields of the node are initialized to null values ​​to indicate that the boundary node has no corresponding adjacent node.

3. The grid topology linked list data structure according to claim 1, characterized in that, The traversal operation includes two modes: row-first traversal and column-first traversal, which can visit all nodes sequentially in a specified direction.

4. The grid topology linked list data structure according to claim 1, characterized in that, The dynamic insertion operation includes inserting a new node in any direction (up, down, left, or right) of a specified node, and updating the direction pointers of adjacent nodes to maintain topology connectivity.

5. The grid topology linked list data structure according to claim 1, characterized in that, The dynamic deletion operation includes: after removing a specified node, reconnecting the direction pointers of its preceding, following, and superimposed nodes to fill node gaps and maintain topological integrity.

6. The grid topology linked list data structure according to claim 1, characterized in that, The grid topology linked list can dynamically expand rows or columns without pre-allocating a fixed amount of storage space, making it suitable for organizing and managing grid-type and network-type data.

Images