com.twitter.cassovary.algorithms
Implementation of approximated triangle counting algorithm by Madhav Jha et al. http://arxiv.org/pdf/1212.2264v3.pdf
We assume that graph is undirected, formally if edge (a, b) is in graph than (b, a) is also.
graph
Implementation of approximated triangle counting algorithm by Madhav Jha et al. http://arxiv.org/pdf/1212.2264v3.pdf
We assume that
graph
is undirected, formally if edge (a, b) is ingraph
than (b, a) is also.