Method | Description | |
---|---|---|
Diff ( |
Compare and match the two trees
|
Method | Description | |
---|---|---|
ConstructCostMatrix ( int distance, int matching1, int matching2, int nodeCount, int costMatrix ) : void |
Construct a least cost matrix (of the flow network) based on the distance matrix
|
|
DiffAttributes ( |
Diff and match two lists of attributes
|
|
DiffElements ( |
Compare and match the two elements (and their children).
|
|
DiffTexts ( |
Diff and match two lists of text nodes
|
|
Distance ( |
Calculate the editing distance between the two nodes (with caching)
|
|
DistanceAttributes ( |
Calculate the editing distance between two lists of attributes
|
|
DistanceElements ( |
Calculate the editing distance between two elements, up to a maximum threshold.
|
|
DistanceMatchList ( |
Compute the minimal editing distance between two lists of elements
|
|
DistanceTexts ( |
Compute the editing distance between two groups of text nodes
|
|
DoMinimalMatching ( int distance, int matching1, int matching2 ) : int |
Perform minimal-cost matching algorithm between two node lists
|
|
FindMinimalMatching ( int distance, int matching1, int matching2 ) : int |
Perform minimal-cost matching between two node lists
|
|
MatchAny ( |
Randomly match nodes any nodes that are unmatched with other unmatched nodes
|
|
MatchEqual ( |
Set match for child nodes with equal hash values (equal sub-trees)
|
|
MatchFilter ( |
Filter out matched elements (equal hashes).
|
|
MatchList ( |
Find minimal cost matching between two node lists; Record the matching info back to the trees.
|
|
SearchNegativeCircuit ( int nodeCount, int costMatrix, int pathMatrix, int circuit ) : int |
Search for negative cost circuit in the least cost matrix.
|
|
SetMatching ( List |
Set the match for the given nodes.
|
|
SetMatching ( |
Set the match for the given node
|
|
SetMatching ( |
Set the match for the given nodes to each other.
|
|
SetUnmatched ( |
Set the match for the given nodes if they do not have a matching node.
|
public static Diff ( |
||
tree1 | ||
tree2 | ||
return | void |