Like the N-closest algorithm, the weight of each candidate is given by the inverse of its distance to the input colour. Because of this, both algorithms produce output of a similar quality, although the N-convex method is measurably faster. As with the last algorithm, more details can be found in the original paper[2].
[&:first-child]:overflow-hidden [&:first-child]:max-h-full"
，详情可参考同城约会
Москвичи пожаловались на зловонную квартиру-свалку с телами животных и тараканами18:04
Meet the history-making astronauts headed for the Moon