private double |
RTED_InfoTree_Opt.computeDistUsingStrArray(InfoTree it1,
InfoTree it2) |
The recursion step according to the optimal strategy.
|
private void |
RTED_InfoTree_Opt.computeIJTable(InfoTree it,
int subtreePreorder,
int subtreeRevPreorder,
int subtreeSize,
int aStrategy,
int treeSize) |
Computes an array where preorder/rev.preorder of a subforest of given subtree is stored and can
be accessed for given i and j.
|
private void |
RTED_InfoTree_Opt.computePeriod(InfoTree it1,
int aVp,
int aNextVp,
InfoTree it2,
int aStrategy) |
Compute period method.
|
private int |
RTED_InfoTree_Opt.jOfI(InfoTree it,
int aI,
int aSubtreeWeight,
int aSubtreeRevPre,
int aSubtreePre,
int aStrategy,
int treeSize) |
Returns j for given i, result of j(i) form Demaine's algorithm.
|
private double |
RTED_InfoTree_Opt.spfH(InfoTree it1,
InfoTree it2,
int[] heavyPath) |
Single-path function for heavy path based on Klein/Demaine algorithm.
|
private double |
RTED_InfoTree_Opt.spfL(InfoTree it1,
InfoTree it2) |
Single-path function for the left-most path based on Zhang and Shasha algorithm.
|
private double |
RTED_InfoTree_Opt.spfR(InfoTree it1,
InfoTree it2) |
Single-path function for right-most path based on symmetric version of Zhang and Shasha
algorithm.
|
private void |
RTED_InfoTree_Opt.treeEditDist(InfoTree it1,
InfoTree it2,
int i,
int j) |
|
private void |
RTED_InfoTree_Opt.treeEditDistRev(InfoTree it1,
InfoTree it2,
int i,
int j) |
|