Hacker Newsnew | past | comments | ask | show | jobs | submitlogin

Thanks, my mistake. You're right, there are n(n-1)/2 arcs in the fully connected graph (K_n).


Guidelines | FAQ | Lists | API | Security | Legal | Apply to YC | Contact

Search: