{'fraction_non_alphanumeric': 0.025423728813559324, 'fraction_numerical': 0.0, 'mean_word_length': 4.839506172839506, 'pattern_counts': {'":': 0, '<': 0, '<?xml version=': 0, '>': 0, 'https://': 0, '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}}
Negative-Weight Cycle Algorithms

The problem of finding a negative cycle in a weighted, directed graph is discussed here. First the algorithm for printing out a negative cycle reachable from the sources, with the running time no worse than the Bellman-Ford algorithm for the single-source shortest-path problem, is presented. Then an approach with the same time complexity, which could be used for outputting a negative cycle that may not be reachable froms, is reported.