does anyone know a algorithm to compare two trees?
I heard something about the Levenshtein algorithm but I can't find anything about it.
Can someone help me?
Itīs probably not the most effective way, but you could recursively traverse both trees and compare the value of each single node (assuming they are trees that can be read completely recursively). As soon as one differs, stop and return false.
More details, plz?
Manuel Hirsch - Linux, FreeBSD, programming, administration articles, tutorials and more.
I want to compare two xml files (tree structure).
The problem is that the one tree don't need to have the same structure like the other. The structure can differ in some cases.
The rusult of the comparison should be a information about:
which nodes of the to trees are equal and at the same position in the trees
which nodes are equal but at different positions
which nodes are just in the one file
and which nodes are just in the other file
The node should be compared by the vlalues of their attributes
I've no idea how to realize this :-(
Hmm i have no idea.. but pseudocode for checking structure of two trees such as a binary tree would be as follows
Code:checksame(tree1,tree2) if(t1 is empty AND t2 is empty) return true if(t1 is empty OR t2 is empty) return false return true AND checksame(t1.right,t2.left) AND checksame(t2.left,t2.right)