News for hackers. Stuff that matters.
Re:Big-O Algorithm Complexity Cheat Sheet by ufo on Sunday May 05, 2013 @01:30PM (#5659054)
Dense graphs, by definition, have close to O(V²) edges already so adjacency matrices aren't wasting space in that case.

There are no comments on this comment yet.