HDX/AV: BestOf for extremes searches

[jteresco]

Instead of just finding the "winning" value or all values that tie for a win in a category, we can find the top "k" values to illustrate the idea of the BestOf structure from [Bailey's Java Structures] (http://www.cs.williams.edu/~bailey/JavaStructures/Welcome.html) lab at the end of Chapter 11. Ideally, the details of such a structure could be visualized (optionally) as well.

[jteresco]

@Spencer-Moon @baileyfcross @LukeJennings1729 would be interested in your thoughts on this, having implemented this kind of structure in Java this past year, and how such an AV might look and whether it might help understand the idea.

[Spencer-Moon]

I think this would be pretty straightforward to implement. All you'd have to do is make the winning vertex panels contain a list rather than just one point. Could get pretty messy for large k though, since the status panel is only 400px.

[jteresco]

I've definitely had some students who had trouble understanding the whole concept of this kind of structure (I think we called it "TopK" for this last time around). Maybe seeing it in action would help in some cases so they could then think about how to implement.