Shortest Path Problem on Neutrosophic Environment using Modified Circle Breaking Algorithm
Amala S. Richard A.Rajkumar D.Nagarajan3* Broumi Said4
1,2Department of Mathematics Hindustan Institute of Technology and Science, Chennai, Tamil Nadu, India.
3Department of Mathematics, Rajalakshmi Institute of Technology, Chennai, India.
4Laboratory of Information processing, Faculty of Science Ben M’Sick, University of Hassan II,
Casablanca, Morocco.
email: amalarichard01@gmail.com1; arajkumar@hindustanuniv.ac.in2; dnrmsu2002@yahoo.com3;broumisaid78@gmail.com4.
Corresponding author: D.Nagarajan; dnrmsu2002@yahoo.com
Neutrosophic set (NS) is generalization of Intuitionistic Fuzzy Set(IFS) and Fuzzy Set (FS) where Neutrosophic Set(NS) is the collection of Membership, Non-Membership, Indeterminacy Membership of the constituent element. This paper includes the modified circle breaking techinque which is used to evaluate the Shortest Path Problem in which edge weight are protrayed in Single Valued Linear Heptagonal Neutrosophic Number (SVLHNN) and an numerical illustration is given for the efficiency of the given algorithm.
Keywords: Shortest Path Problem; Modified Circle Breaking Algorithm; Single Valued Linear Heptagonal Neutrosophic Number