Enayattabr et al. (Journal of Intelligent and Fuzzy Systems 37 (2019) 6865– 6877) claimed that till now no one has proposed an approach to solve interval-valued trapezoidal fuzzy all-pairs shortest path problems (all-pairs shortest path problems in which distance between every two nodes is represented by an interval-valued trapezoidal fuzzy number). Also, to fill this gap, Enayattabr et al. proposed an approach to solve interval-valued trapezoidal fuzzy all-pairs shortest path problems. In this paper, an interval-valued trapezoidal fuzzy shortest path problem is considered to point out that Enayattabr et al.’s approach fails to find correct shortest distance between two fixed nodes. Hence, it is inappropriate to use Enayattabr et al.’s approach in its present from. Also, the required modifications are suggested to resolve this inappropriateness of Enayattabr et al.’s approach.

中文翻译：

---

一种解决区间值模糊网络中所有对最短路径问题的新方法：建议修改

Enayattabr 等。（Journal of Intelligent and Fuzzy Systems 37 (2019) 6865–6877）声称，到目前为止，没有人提出一种方法来解决区间值梯形模糊全对最短路径问题（all-pairs shortest path questions，其中每个两个节点由一个区间值梯形模糊数表示）。此外，为了填补这一空白，Enayattabr 等人。提出了一种求解区间值梯形模糊全对最短路径问题的方法。本文考虑了一个区间值梯形模糊最短路径问题，指出Enayattabr等人的方法未能找到两个固定节点之间的正确最短距离。因此，现在使用 Enayattabr 等人的方法是不合适的。还，