{'fraction_non_alphanumeric': 0.011538461538461539, 'fraction_numerical': 0.0, 'mean_word_length': 4.542553191489362, '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}}
A New Algorithm for Minimum Path in a Network

A new algorithm namely, path labeling algorithm for finding the minimum path from a specified node to other nodes in a network having crisp or imprecise weights is introduced. The proposed algorithm is simple and easy to understand and apply. The path labeling algorithm is illustrated with help of numerical examples. The minimum paths obtained from one node to each node of a network can be helpful to decision-makers as they make decision to use minimum number of nodes.