Home | Trees | Indices | Help |
---|
|
object --+ | data_structure.DataStructure --+ | TTree
class TTree(DataStructure) - T-Tree implementation t_tree format : [module_permutation, topology, module_rotations] ternary tree topology is in a list format where each entry represents a node. The index of the root node is also returned. panholzer = ([[LEFT, MIDDLE, RIGHT, PARENT, INTERNAL, DEPTH], ...], root) topology = TT.transform_panholzer_to_topology(T, root) rotations only 0 and 90 degrees TODO: detailed docstring, verification and rectification step needed after applying permutation operations
|
|||
|
|||
|
|||
|
|||
|
|||
|
|||
|
|||
|
|||
|
|||
|
|||
|
|||
|
|||
|
|||
|
|||
|
|||
|
|||
|
|||
|
|||
|
|||
Inherited from Inherited from |
|
|||
name =
|
|||
__H_NAME = 0
|
|||
__H_PARENT = 1
|
|||
__H_LEFT_CHILD = 2
|
|||
__H_MIDDLE_CHILD = 3
|
|||
__H_RIGHT_CHILD = 4
|
|||
__H_WIDTH = 5
|
|||
__H_HEIGHT = 6
|
|||
__H_DEPTH = 7
|
|||
__H_X = 8
|
|||
__H_Y = 9
|
|||
__H_Z = 10
|
|||
Inherited from |
|
|||
Inherited from |
|
x.__init__(...) initializes x; see x.__class__.__doc__ for signature
|
insert into horizontal contour c ... contour, initially c = [[0,0]] |
S ... a stack n ... a node of T-Tree |
n ... a node of a binary tree L ... a list to store nodes |
Tree packing process described in [Yuh2009] H ... a T-Tree |
DFS list structure used by t-tree packing algorithm. H = [[name, parent, left, middle, right, width, height, depth, x, y, z], ...] |
Return packing in dict format. packing = {'name' : [x, y, z, w, h, d], ...}
|
|
is not possible with every data structure
|
returns a dict of possible operations onto a abstract representation {'name' : [function, globality_factor]} globality_factor ... the higher, the bigger is the solution change this factor is given by the authors but it also can be determined in test runs evaluation the cost influences caused by applying the according function.
|
Merge two representations into all possible children. Typically, used for genetic and/or evolutionary algorithms. Returns a list with all possible children. In case of T-Tree all possible combinations of the module permutations, topologies second and rotations are generated. Rotations are currently completely taken from representation a or b, respectively. Thus 2^3 different children are possible. |
Home | Trees | Indices | Help |
---|
Generated by Epydoc 3.0.1 on Wed Apr 27 17:47:09 2011 | http://epydoc.sourceforge.net |