Architecture

##Graph

• Investigate methods of storing graph objects efficiently in memory.
• For larger graphs, maybe a consistent distributed and fast KV store would be better instead of dumping it in RAM
• The API (under construction) might look as follows
  • getEdgeList(VertexID)
  • putEdgeList(VertexID, EdgeList)

##Reader Under construction ##Writer Currently, we have a crude implementation of graph Writers. The interface, which can be seen in writer.h, currently gives the whole adjacency lists, number of vertices and number of edges to the corresponding Writer. The Writer then dumps the whole graph to the output file according to format of which subclass of Writer it is.