Tree node expansion method based on multiple selected nodes, electronic device, and medium
By constructing a list of nodes and a stack of nodes to be processed, the problem of low efficiency in expanding tree nodes is solved, achieving efficient and accurate expansion of tree nodes and simplifying the expansion operation of complex tree data structures.
Patent Information
- Application Number
- CN202511273170.1
- Authority / Receiving Office
- CN · China
- Patent Type
- Patents(China)
- Current Assignee / Owner
- Filing Date
- 2025-09-08
- Publication Date
- 2025-11-07
- Estimated Expiration
- 2045-09-08
AI Technical Summary
In electronic design automation, expanding tree nodes based on multiple selected nodes is inefficient and error-prone, and existing technologies struggle to improve both efficiency and accuracy.
By constructing a list of currently selected nodes and combining it with a stack of nodes to be processed, the system uses depth-first traversal as the main approach, supplemented by breadth-first traversal, to gradually expand each currently selected node to the required expansion depth. The stack of nodes to be processed is used to ensure the accuracy and efficiency of node expansion.
It improves the efficiency and accuracy of tree node expansion, simplifies the expansion operation of complex tree data structures, reduces errors, and enhances the user experience.