Abstract
This paper studies the inclusion relational structure connection algorithms in three basic structure relationships, namely MPMGJN algorithm, Stack-Tree algorithm and Queue-Tree algorithm. The MPMGJN algorithm is the most basic structure connection algorithm and is less efficient due to unnecessary scanning and searching during connection. On this basis, this paper compares and analyzes two improved cache-based structure connection algorithms, Stack-Tree algorithm and Queue-Tree algorithm. At the end of the paper, the Queue-Tree algorithm implemented in C# is given, and the algorithm is tested with simulation data.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callMore From: IOP Conference Series: Materials Science and Engineering
Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
