A strongly connected digraph is called a cactoid-type digraph if each of its blocks is a digraph consisting of finitely many oriented cycles sharing a common directed path. In this article, we find the formula for the determinant of the distance matrix for a weighted cactoid-type digraph and find its inverse, whenever it exists. We also compute the determinant of the distance matrix for a class of unweighted and undirected graphs consisting of finitely many cycles, sharing a common path.

中文翻译：

---

加权仙人掌型有向图的距离矩阵

如果强连通有向图的每个块都是由共享公共有向路径的有限多个有向循环组成的有向图，则强连通有向图称为 cactoid 型有向图。在这篇文章中，我们找到了加权 cactoid 型有向图的距离矩阵的行列式的公式，并找到它的逆矩阵，只要它存在。我们还计算了一类由有限多个循环组成的共享公共路径的未加权和无向图的距离矩阵的行列式。