HTML → Graph
The page's DOM is parsed into a directed graph. Every element becomes a node with serialized metadata. Color shows its fate in the algorithm.
DOM as a Graph
Every element is a node; edges connect parent → child. Color shows each node's fate: green = winner, blue = candidate, red = filtered out, gray = skipped. Node size reflects metadata length.
Candidate Analysis — Children Metadata Lengths
Each row is a candidate node that survived filtering. Each dot is one of its children, plotted at its metadata char length. The shaded band is ±1 std dev around the mean. The listing container stands out: many dots, tightly clustered, at a high value.
Scoring Breakdown
Each of 7 criteria awards 1 point to the best candidate. The node with the most points wins. ★ marks the winner of each criterion.
Extracted Listings
The winner node's children are the listing cards. Their text fields contain the actual product data — pulled out without writing a single XPath or CSS selector.