Download or read book SHORTEST PATH PROBLEM BY MINIMAL SPANNING TREE ALGORITHM USING BIPOLAR NEUTROSOPHIC NUMBERS written by M. Mullai and published by Infinite Study. This book was released on with total page 9 pages. Available in PDF, EPUB and Kindle. Book excerpt: 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.