The repository contains the implementation of CLI that can generate, print and save trees. Also calculates the list of transformations required to get the second tree from the first.
video.mp4
Run the programm using executable file.
The CLI is developed with picocli. To find out what startup parameters exist, use the -h, --help or help parameter, as shown in the video.
This program accepts 2 general trees as an input and calculates the list of transformations required to get the second tree from the first.
To run it use the command ./tree-transformer.sh transforming. You can add the parameter -p or --print-trees to print both trees to the consonle. Also you can define the files name in parameters or print them in the console after the programm starts.
As a result you will get a list of transformations required to get the second tree from the first.
The program accepts trees in the format:
$[${parentId1}$,${id1}$]$[${parentId2}$,${id2}$]$...
where $ - the different number of whitespaces. All ids must have Long format.
This programm accepts ADD, REMOVE and EXIT commands and applies them to the tree stored in memory. After each command, the current tree structure is printed to the console. After each command the programm saves and loads the generated tree in binary format.
To run it use the command ./tree-transformer.sh creating. You can add the parameter -l or --load-tree to load the tree from file before the program starts. Also you can define the file name in parameters, which will be used to save the tree and from which the tree will be loaded. If you do not specify it, the standard file tree.txt will be used.
Аfter the program starts, you can generate the tree with the ADD and REMOVE commands. To end the program use the EXIT command.
The program accepts commands in the format:
$ADD(${parentId}$,${id}$)$, $REMOVE(${id}$)$
where $ - the different number of whitespaces. The program is case-insensitive, so you can print reMoVe too. All ids must have Long format.
The TreeImpl class uses Map to build tree, so the amortized time for ADD and REMOVE is O(1). Thus, to build a tree from a file takes O(n).
SerializableTree is an abstract class that implements Tree and Externalizable interfaces. It was decided to implement Externalizable because we can save trees more efficiently than with Serializable. We only need to serialize the list of edges. And as we can build the tree in O(n) it is also fast. All other tree classes should extend this class to be serializable.
TreeTransformer takes two trees and finds a transformation list for O(n).