Ramsey's theorem: Difference between revisions
→{{header|C}}
(Removing invalid flag from C code) |
|||
Line 179:
=={{header|C}}==
For 17 nodes, (4,4) happens to have a special solution: arrange nodes on a circle, and connect all pairs with distances 1, 2, 4, and 8. It's easier to prove it on paper and just show the result than let a computer find it (you can call it optimization).
No issue with the code or the output, there seems to be a bug with Rosettacode's tag handlers. - aamrun
<lang c>#include <stdio.h>
| |||