Source code underlying the publication: Privacy-Preserving Peer-to-Peer Cycle Detection

Runs an implementation of the distributed cycle detection protocol and measures its runtime and communication performance. Performance is measured on randomly generated Barabási–Albert graphs for a range of graph densities and searched-for cycle lengths. For each graph, the protocol is repeated in its entirety for each node. Average results for each set of input parameters are written to a CSV file, which can be plotted in figures using the included code.