Speed boost to adjacency matrix
Posted
by samoz
on Stack Overflow
See other posts from Stack Overflow
or by samoz
Published on 2009-02-24T21:18:17Z
Indexed on
2010/04/04
15:33 UTC
Read the original article
Hit count: 420
I currently have an algorithm that operates on an adjacency matrix of size n by m. In my algorithm, I need to zero out entire rows or columns at a time. My implementation is currently O(m) or O(n) depending on if it's a column or row.
Is there any way to zero out a column or row in O(1) time?
© Stack Overflow or respective owner