Scholarlink

In this paper, a novel Dijkastra’s algorithms is proposed to find the shortest path between two nodes on a webwork, where all the information of connections of edge’s weight are expressed as the quadripartitioned single-valued neutrosophic set (QpSVNS). QpSVNS is an extension of the neutrosophic sets (NSs) which have four components that express the truth value, the contradiction value, the ignorance value, the false value, respectively, and hence can capture large relevant information from ambiguous or indeterminate data. In the environment of QpSVNS, a relevant obvious route problem from the surrounding area has been taken and solved to validate the proposed algorithm, and its effectiveness has been justified by the obtained optimal solution. Furthermore, the future work has been discussed to suggest its relevant prospects.

错误：搜索内容不能为空，请输入英文关键词
错误：关键词超出字数限制，请精简
高级检索

Solving a Shortest Path Problem Using Dijkstra’s Algorithm in the Quadripartitioned Neutrosophic Environment

  • 会议论文

  • 发表日期：

    2025年

查看全文
  • Chandni Thakur,
  • Akanksha Singh

摘要

In this paper, a novel Dijkastra’s algorithms is proposed to find the shortest path between two nodes on a webwork, where all the information of connections of edge’s weight are expressed as the quadripartitioned single-valued neutrosophic set (QpSVNS). QpSVNS is an extension of the neutrosophic sets (NSs) which have four components that express the truth value, the contradiction value, the ignorance value, the false value, respectively, and hence can capture large relevant information from ambiguous or indeterminate data. In the environment of QpSVNS, a relevant obvious route problem from the surrounding area has been taken and solved to validate the proposed algorithm, and its effectiveness has been justified by the obtained optimal solution. Furthermore, the future work has been discussed to suggest its relevant prospects.