|
home
Tree-like algorithms data structure
The algorithm tree structure is stored in text files. The tree
root is the name of the file. Newlines indicate branches of the
tree root. Sub-branches are implemented with newlines followed by
nesting tab(s); so on till the leaf nodes (see table tree_example_table).
Table 1: Example
| Where a and b are the 1st level branches, a1 and b1 the 2nd
level branches and a11 and b11 the leaf |
The selected algorithm is displayed in a new window. Branches
can be expanded to show sub-branches. The final leaf node will simply
not bring any further and is visualized in a different color (see
figure tree_pic).
Figure 2: Tree algorithm example
|
