{'fraction_non_alphanumeric': 0.026729559748427674, 'fraction_numerical': 0.0, 'mean_word_length': 5.434343434343434, '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}}
Application of Floyd's Algorithm in Interval Valued Neutrosophic Setting

An algorithm with complete and incremental access is called a Floyd algorithm (FA). It determines shortest path for all the pairs in the network. Though there are many algorithms have been designed for shortest path problems (SPPs), due to the completeness of Floyd's algorithm, it has been improved by considering interval valued neutrosophic numbers as the edge weights to solve neutrosophic SPP (NSPP). Further, the problem is extended to triangular and trapezoidal neutrosophic environments. Also, comparative analysis has been done with the existing method.