Implement a triangle counting algorithm

[pankajgupta]

for example, the randomized algorithm in http://arxiv.org/abs/1212.2264 or one of the other algorithms mentioned in this paper.

[szymonm]

Triangle counting is usually done for undirected graphs. How do you want this to be done?

There are methods for the problem described here: http://arxiv.org/pdf/1309.3321v2.pdf but do you think they will have practical application?

[pankajgupta]

It is fine to do this only for undirected graphs to start with.

[pankajgupta]

Done here: #62