作者
Said Broumi, Mohamed Talea, Assia Bakali, Florentin Smarandache
发表日期
2016/12/6
研讨会论文
2016 IEEE symposium series on computational intelligence (SSCI)
页码范围
1-6
出版商
IEEE
简介
In this paper, the authors propose an extended version of Dijkstra' algorithm for finding the shortest path on a network where the edge weights are characterized by an interval valued neutrosophic numbers. Finally, a numerical example is given to explain the proposed algorithm.
学术搜索中的文章
S Broumi, M Talea, A Bakali, F Smarandache - 2016 IEEE symposium series on computational …, 2016