Oh wizened wizards, Does anyone know of a c/c++ sparse matrix code that handle a 20,000 x 20,000 adjacency matrix? Probably only 3 ones in an average column. I just need to compute X^n where n is from 2 to 8. Or is this just entirely unreasonable to do in a couple gigs of memory? (gcc 4.x, Linux x86) Thanks, --Dean -- Av8 Internet Prepared to pay a premium for better service? www.av8.net faster, more reliable, better service 617 256 5494
