{'fraction_non_alphanumeric': 0.034340659340659344, 'fraction_numerical': 0.008241758241758242, 'mean_word_length': 4.879032258064516, 'pattern_counts': {'":': 0, '<': 0, '<?xml version=': 0, '>': 0, 'https://': 1, 'lorem ipsum': 0, 'www.': 0, 'xml': 0}, 'pii_count': 0, 'substrings_counts': 0, 'word_list_counts': {'cursed_substrings.json': 0, 'profanity_word_list.json': 0, 'sexual_word_list.json': 0, 'zh_pornsignals.json': 0}}
Minimum Spanning Trees

Minimum spanning trees are one of the most important primitives used in graph algorithms. They find applications in numerous fields ranging from taxonomy to image processing to computer networks. In this report, we present 3 algorithms to compute the minimum spanning tree (MST) or minimum spanning forest (MSF) for large graphs which do not fit in the memory of a single machine. We analyze the theoretical processing time, communication cost and communication time for these algorithms under certain assumptions. Finally, we compare the performance of the 3 algorithms on real-world data using Apache Spark [1]. The code for the project can be found here. https://github.com/s-ramaswamy/CME-323-project