News for hackers. Stuff that matters.
Re:The World's Simplest Interesting Algorithm (2019) by thethirdone on Wednesday June 10, 2020 @01:41AM (#23474314)
You only need one of the vertices of an edge to cover that edge.

So in the simplest case of two vertices connected by an edge, your algorithm would generate a set of size 2 instead of the minimum size 1.

There are no comments on this comment yet.