Minimum Spanning Tree on World Famous Seven Statues with Prim’s and Kruskal Algorithm using Neutrosophic Fuzzy Graphs

The concept of this research is introduced to minimum spanning tree with prim's and Kruskal algorithm using neutrosophic fuzzy graph which is combined real world famous seven statues shortest path problem. In this analysis, proposed algorithm finds source node and destination node because of the shortest path problem. In this research, we apply minimum spanning tree prim's and Kruskal algorithm neutrosophic fuzzy graph and finding their score function. Finally we conclude famous seven statues shortest path problem.