protopizza
commented
9 years ago Done. To calculate this, I created a table of which items get built into which items (going up all the way into the tree). Then when looking at the common items for a champion at the end, we take our window size (6) and see if there's any items that build into another one of the common 6 (using the previously created table which is stored as JSON). Then that item is removed and the next most common moves into the top 6 window.
needs consideration. for example qss isn't always finished on adc