The first release

This release provides the programming framework for users to implement graph algorithms for processing massive graphs. It also provides some graph algorithm implementation such as

• weakly connected components,
• strongly connected components,
• PageRank,
• triangle counting,
• diameter estimation,
• Kcore,
• clustering coefficient,
• spectral clustering,
  ...

It also provides an eigensolver and SVD.

The release also provides R bindings, so that R users can invoke the existing graph implementation in FlashGraph to process massive graphs.