This package computes the number of hypertriangles and other motifs with three hyperedges in any hypergraph.
Just run make in the main folder. It requires g++.
Run ditch.exe / ditch <hypergraph_file> <c(losed)/a(ll)/s(tatistics)/st(ars)> <output_file (only for s and st, do not include .csv)>
example call: ditch.exe ./Datasets/email-Eu.csv c
or
ditch ./Datasets/email-Eu.csv c
The file must be in comma-delimited csv format. Each Row will correspond to one hyperedge with each column corresponding to each vertex of the hyperedge. Do not include a header. We obtained all the datasets from https://www.cs.cornell.edu/~arb/data/ and cleaned repeated hyperedges and temporal information.
Closed (c): Only patterns 1-20
All (a): All patterns 1-26
Statistics (s): Only outputs statistics, requires an extra parameter <output_file>. The program will create files prefixed by <output_file> with the degrees and outdegrees distributions.
Stars (st): Equivalent to c, additionally outputs a csv file with the distribution of stars (pattern 9) depending on the intersection size.