IntelliPaper
Abstract
The minimal spanning tree (MST) algorithms by using the edges weights are elderly presented mainly by Prim??s and Kruskal??s algorithms. In this article we use the weights for the bipolar neutrosophic edges by using the score functions we angry with the new model algorithms namely bipolar neutrosophic Prim??s algorithm and bipolar neutrosophic Kruskal??s algorithm. Further, we use the score functions we get the satisfied results based on the algorithms.
Explore Digital Article Text
Article file ID not found.
Conflict of Interest
The authors declare no conflict of interest.
Ethical Approval
Not applicable
Data Availability
The datasets used in this study are openly available at [repository link] and the source code is available on GitHub at [GitHub link].
Funding
This work did not receive any external funding.
Cite this article
Generating citation...
Related Research
