Hi all,

I am currently working on some graph projects with a friend, and I would like to know if there is anyway to reduce the size taken by adjacency matrixes to save as many memory as possible.

I am assuming we need the Matrix representation as we need to compute flows and related stuf… But, maybe this can be done with adjacency list too…

If there’s any compression algorithm someone could point me out, I’d be very glad

Thanks in advance,

Bruno