Y
HN Search
Hacker News Search
new
|
comments
|
top
|
jobs
v_g
searching PlanetScale…
1.
▲
2.
▲
3.
▲
4.
▲
5.
▲
6.
▲
4 ms
·
1.
▲
by
v_g
6y ago
If I go through the list of edges one by one and push the two vertices of each edge into a Set, at the end wouldn’t I end up with the minimum number of vertices needed to cover the graph? Most likely I’m not understanding the problem, would
2.
▲
by
v_g
6y ago
Interesting point. However, Alphabet is probably not the best example, Unicode perhaps? The upper bound in Unicode is ~ 1.1 Million, but still fixed