News for hackers. Stuff that matters.
Re:Big-O Algorithm Complexity Cheat Sheet by gsg on Sunday May 05, 2013 @04:29AM (#5657840)
The space taken by an adjacency matrix doesn't depend on edge count. That's why it is usually the favoured representation for dense graphs.

There are no comments on this comment yet.