-
Notifications
You must be signed in to change notification settings - Fork 1
Commit
This commit does not belong to any branch on this repository, and may belong to a fork outside of the repository.
- Loading branch information
1 parent
cc2b782
commit 00151e9
Showing
1 changed file
with
12 additions
and
0 deletions.
There are no files selected for viewing
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
Original file line number | Diff line number | Diff line change |
---|---|---|
@@ -0,0 +1,12 @@ | ||
# RTDMTD algorithm | ||
|
||
I implemented the algorithm in this paper using Beautifulsoup: | ||
|
||
http://citeseerx.ist.psu.edu/viewdoc/download?doi=10.1.1.105.629&rep=rep1&type=pdf | ||
|
||
|
||
These are the steps in the algorithm: | ||
- Guiven 2 pages A and B, use the DOM of the pages to represent them as trees. | ||
- Find the edition between the 2 pages with minimal cost. The possible tree editions are: insertion, deletion or replace | ||
- The nodes that are keep intact in the edition with minimal cost are considered template nodes. | ||
Create the minimal subtree containing that nodes. This subtree is the template. |