Enumeration of trees from finite number of nodes
First Claim
Patent Images
1. A method of enumerating complex two-dimensional graphical hierarchies for more convenient processing and/or storage, a complex two-dimensional graphical hierarchy being in the form of a tree hierarchy, the method comprising:
- accessing instructions from one or more physical memory devices for execution by one or more processors;
executing instructions accessed from the one or more physical memory devices by the one or more processors;
storing, in at least one of the physical memory devices, signal values resulting from having executed the instructions on the one or more processors;
wherein the accessed instructions to enumerate tree hierarchies; and
wherein executing the accessed tree hierarchy enumeration instructions further comprising;
enumerating tree hierarchies, in which a tree hierarchy comprises one or more signal values, configured from a finite number (N) of nodes, wherein N comprises a natural numeral greater than one, the enumerating of tree hierarchies configured from the finite number of nodes further comprising;
identifying N−
1 arrangements of subtree hierarchy slots coupled to a root node;
for an arrangement of subtree hierarchy slots;
determining one or more allocations of N−
1 nodes among the subtree hierarchy slots in the arrangement, a subtree hierarchy slot being allocated a portion of the N−
1 nodes; and
for the subtree hierarchy slots, enumerating one or more subtree hierarchies configured from the portion of the N−
1 nodes allocated to the subtree hierarchy slot;
determining for the enumerated tree hierarchies natural numerals associated with particular ones of the enumerated tree hierarchies; and
storing, in a memory, the natural numerals.
3 Assignments
0 Petitions
Accused Products
Abstract
Embodiments of methods, apparatuses, devices and/or systems for manipulating hierarchical sets of data are disclosed.
-
Citations
36 Claims
-
1. A method of enumerating complex two-dimensional graphical hierarchies for more convenient processing and/or storage, a complex two-dimensional graphical hierarchy being in the form of a tree hierarchy, the method comprising:
-
accessing instructions from one or more physical memory devices for execution by one or more processors; executing instructions accessed from the one or more physical memory devices by the one or more processors; storing, in at least one of the physical memory devices, signal values resulting from having executed the instructions on the one or more processors; wherein the accessed instructions to enumerate tree hierarchies; and wherein executing the accessed tree hierarchy enumeration instructions further comprising; enumerating tree hierarchies, in which a tree hierarchy comprises one or more signal values, configured from a finite number (N) of nodes, wherein N comprises a natural numeral greater than one, the enumerating of tree hierarchies configured from the finite number of nodes further comprising; identifying N−
1 arrangements of subtree hierarchy slots coupled to a root node;for an arrangement of subtree hierarchy slots; determining one or more allocations of N−
1 nodes among the subtree hierarchy slots in the arrangement, a subtree hierarchy slot being allocated a portion of the N−
1 nodes; andfor the subtree hierarchy slots, enumerating one or more subtree hierarchies configured from the portion of the N−
1 nodes allocated to the subtree hierarchy slot;determining for the enumerated tree hierarchies natural numerals associated with particular ones of the enumerated tree hierarchies; and storing, in a memory, the natural numerals. - View Dependent Claims (2, 3, 4, 5, 6, 7, 8, 9)
-
-
10. An apparatus to enumerate a complex two-dimensional graphical hierarchy for more convenient processing and/or storage, a complex two-dimensional graphical hierarchy being in the form of a tree hierarchy, the apparatus comprising:
-
means for accessing instructions from one or more physical memory devices for execution by one or more processors; means for executing instructions accessed from the one or more physical memory devices by the one or more processors; means for storing, in at least one of the physical memory devices, signal values resulting from having executed the instructions on the one or more processors; wherein the accessed instructions to enumerate tree hierarchies; and wherein the means for executing the accessed tree hierarchy enumeration instructions comprises; means for enumerating tree hierarchies, a tree hierarchy to comprise one or more signal values, configured from a finite number (N) of nodes, wherein N comprises a natural numeral greater than one;
the means for enumerating tree hierarchies configured from the finite number of nodes further comprises;means for identifying N−
1 arrangements of subtree hierarchy slots coupled to a root node;means for determining one or more allocations of N−
1 nodes among the subtree hierarchy slots in an identified arrangement of subtree hierarchy slots, a subtree hierarchy slot being allocated a portion of the N−
1 nodes; andmeans for enumerating one or more subtree hierarchies, configured from the portion of the N−
1 nodes allocated to the subtree hierarchy slot;means for determining, for the enumerated tree hierarchies, natural numerals associated with particular ones of the enumerated tree hierarchies; and means for storing, in a memory, the natural numerals. - View Dependent Claims (11, 12, 13, 14, 15, 16, 17, 18)
-
-
19. An apparatus comprising:
-
one or more processors coupled to one or more physical memory devices to store executable instructions and to store binary digital signal quantities as physical memory states, wherein the executable instructions being; accessible from the physical memory devices for execution by one or more processors; executable by the one or more processors; and able to store in at least one of the physical memory devices, binary digital signal quantities, if any, that are to result from execution of the instructions on the one or more processors, wherein the accessed executable instructions to enumerate tree hierarchies; and wherein the accessed tree hierarchy enumeration instructions further; to enumerate tree hierarchies, a tree hierarchy to comprise one or more signal values, configured from a finite number (N) of nodes, wherein N comprises a natural numeral greater than one, wherein to enumerate tree hierarchies configured from the finite number of nodes further comprises to; identify N−
1 arrangements of subtree hierarchy slots to be coupled to a root node;determine one or more allocations of N−
1 nodes among the subtree hierarchy slots in a to be identified arrangement of subtree hierarchy slots, a subtree hierarchy slot to be allocated a portion of the N−
1 nodes; andenumerate one or more subtree hierarchies configured from the portion of the N−
1 nodes to be allocated to the subtree hierarchy slot;to determine for the to be enumerated tree hierarchies natural numerals to be associated with particular ones of the to be enumerated tree hierarchies; and to store, in a memory, the natural numerals. - View Dependent Claims (20, 21, 22, 23, 24, 25, 26, 27)
-
-
28. An article comprising:
-
a non-transitory storage medium comprising instructions stored thereon, wherein the instructions being accessible from the non-transitory storage medium to store as physical memory states on one or more physical memory devices, the one or more physical memory devices coupled to one or more processors able to execute the instructions stored as physical memory states, the one or more physical memory devices also able to store binary digital signal quantities, if any, as physical memory states, that are to result from execution of the instructions on the one or more processors, wherein the executable instructions to enumerate tree hierarchies; and wherein tree hierarchy enumeration instructions further; to enumerate tree hierarchies, a tree hierarchy to comprise one or more signal values, configured from a finite number (N) of nodes, wherein N comprises a natural numeral greater than one, wherein to enumerate tree hierarchies configured from the finite number of nodes further to; identify N−
1 arrangements of subtree hierarchy slots to be coupled to a root node;determine one or more allocations of N−
1 nodes among the subtree hierarchy slots in a to be identified arrangement of subtree hierarchy slots, a subtree hierarchy slot to be being allocated a portion of the N−
1 nodes; andenumerate one or more subtree hierarchies configured from the portion of the N−
1 nodes to be allocated to the subtree hierarchy slot;to determine for the to be enumerated tree hierarchies natural numerals to be associated with particular ones of the to be enumerated tree hierarchies; and to store, in a memory, the natural numerals. - View Dependent Claims (29, 30, 31, 32, 33, 34, 35, 36)
-
Specification