title: Large Graph Representation in C++
body: <p>There might be similar questions but I still have some parts that I couldn't figure out. I'm trying represent an undirected graph with no weights but just <b>1</b> for connected and <b>0</b> for not connected. I'm trying to represent a graph (reading from a file) which have 80500 nodes and over 5.5 million edges. I was wondering;</p>
  
  <ol>
  <li>Is it going to be a huge impact if I change my adjacency matrix(the one that I'm currently using) to a adjacency list. I have no problem with the implementation just asking will it worth the time to convert it to list?</li>
  <li>Since I just store <b>1</b> and <b>0</b> is there a special data type no store this. I'm using in and I guess a <b>byte</b> data type would save a lot of time.</li>
  <li>Any other structure than adjacency matrix or list that could be better for this typical problem?</li>
  </ol>