This main purpose of this paper is to develop an algorithm to find the shortest path on a network in which the weights of the edges are represented by bipolar neutrosophic numbers. Finally, a numerical example has been provided for illustrating the proposed approach.
No takes yet. Share an insight, caveat, or question.
Broumi et al. (2016) studied this question.
Synapse has enriched 5 related papers. Consider them for comparative context: