Is there a good way to implement graph algorithms?

[Anurag]

For community detection, do you want all conneted components or you want all connected nodes for a given starting node?

The latter is easy with recurse query. Take a look at this post.

For pagerank, I will have to understand more about that