Every story and comment from the Hacker News API, in a layout borrowed from 2001.
A comment on Pac-Man Proved NP-Hard. Parent comment
Input: A, B : integers
Output: directed graph G(V, E, w) (V = vertices, E = edges, w = weight fn)
V = {c1, c2, c3}
E = {(c1, c2), (c2, c3), (c3, c1)}
w(c1, c2) = A
w(c2, c3) = B
w(c3, c1) = 0
shortest tour is the only valid tour whose length is clearly A + B.
There are no comments on this comment yet.
Input: A, B : integers
Output: directed graph G(V, E, w) (V = vertices, E = edges, w = weight fn)
V = {c1, c2, c3}
E = {(c1, c2), (c2, c3), (c3, c1)}
w(c1, c2) = A
w(c2, c3) = B
w(c3, c1) = 0
shortest tour is the only valid tour whose length is clearly A + B.