{'fraction_non_alphanumeric': 0.025597269624573378, 'fraction_numerical': 0.0, 'mean_word_length': 5.311827956989247, '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}}
Formal Programming for the Shortest Path and Its Critical Edge Problems

Many problems in operations research can be formulated in terms of networks, among which the shortest path is a particularly important class. Using the PAR method, we formally derive and implement algorithmic programs for three typical network problems, including the shortest path tree (SPT) problem, the most vital edge (MVE) problem, and the real time critical edge (RTCE) problem, which are motivated by routing applications. The main ideas and ingenuity of these algorithms are revealed by formula deduction.