Method and/or system for tagging trees
First Claim
Patent Images
1. A method of executing computer instructions on at least one computing device without further human interaction in which the at least one computing device includes at least one processor and at least one memory, the method comprising:
- executing computer instructions on the at least one processor of the at least one computing device, the computer instructions having been stored on the at least one memory; and
storing in the at least one memory of the at least one computing device any results of having executed the computer instructions on the at least one processor of the at least one computing device;
wherein the computer instructions to be executed comprise instructions for identifying and traversing nodes in a complex tree hierarchy;
wherein the executing the identifying and traversing node computer instructions further comprises;
identifying a selected group of nodes for traversal of the complex tree hierarchyfor the selected group of nodes, attaching respective labeled edges and respective supporting nodes, wherein the labeled edges are to be labeled with specific content to indicate that a selected node of the selected group of nodes is to be traversed; and
attaching respective subtrees with edges labeled with the specific content, to the respective supporting nodes,the respective subtrees to indicate a sequential numerical order of traversal for the selected group of nodes.
3 Assignments
0 Petitions
Accused Products
Abstract
Embodiments of methods and/or systems for tagging trees are disclosed.
305 Citations
34 Claims
-
1. A method of executing computer instructions on at least one computing device without further human interaction in which the at least one computing device includes at least one processor and at least one memory, the method comprising:
-
executing computer instructions on the at least one processor of the at least one computing device, the computer instructions having been stored on the at least one memory; and storing in the at least one memory of the at least one computing device any results of having executed the computer instructions on the at least one processor of the at least one computing device; wherein the computer instructions to be executed comprise instructions for identifying and traversing nodes in a complex tree hierarchy; wherein the executing the identifying and traversing node computer instructions further comprises; identifying a selected group of nodes for traversal of the complex tree hierarchy for the selected group of nodes, attaching respective labeled edges and respective supporting nodes, wherein the labeled edges are to be labeled with specific content to indicate that a selected node of the selected group of nodes is to be traversed; and attaching respective subtrees with edges labeled with the specific content, to the respective supporting nodes, the respective subtrees to indicate a sequential numerical order of traversal for the selected group of nodes. - View Dependent Claims (2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15, 16, 17)
-
-
18. An apparatus comprising:
-
at least one computing device; the at least one computing device including at least one processor and at least one memory; the at least one computing device to execute computer instructions on the at least one processor without further human interaction; the computer instructions to be executed to have been stored on the at least one memory for execution on the at least one processor; and the at least one computing device to store in the at least one memory of the at least one computing device any results to be generated from the execution on the at least one processor of the to be executed computer instructions; the computer instructions to be executed to comprise instructions to identify and traverse a selected group of nodes of a complex tree hierarchy; wherein the computer instructions to identify and traverse the selected group of nodes further comprise instructions to; identify the selected group of nodes for traversal in the complex tree hierarchy; for the selected group of nodes, attach respective labeled edges respective supporting nodes, wherein the labeled edges are labeled with specific content to indicate that a selected node is to be traversed; and attach respective subtrees with edges labeled with the specific content, to the respective supporting nodes, the respective subtrees to indicate a sequential numerical order of traversal for the selected group of nodes. - View Dependent Claims (19, 20, 21, 22, 23, 24, 25, 26, 27, 28, 29, 30, 31, 32, 33, 34)
-
Specification