SHORTEST PATH PROBLEM BY MINIMAL SPANNING TREE ALGORITHM USING BIPOLAR NEUTROSOPHIC NUMBERS
Author | : M. Mullai |
Publisher | : Infinite Study |
Total Pages | : 9 |
Release | : |
Genre | : |
ISBN | : |
Normally, Minimal Spanning Tree algorithm is used to find the shortest route in a network. Neutrosophic set theory is used when incomplete, inconsistancy and indeterminacy occurs. In this paper, Bipolar Neutrosophic Numbers are used in Minimal Spanning Tree algorithm for finding the shortest path on a network when the distances are inconsistant and indeterminate and it is illustrated by a numerical example.