This paper presents an algorithm for structurally hashing directed graphs. The algorithm seeks to fulfill the recursive principle that a hash of a node should depend only on the hash of its neighbors. The algorithm works even in the presence of cycles, which prevents a naive recursive algorithm from functioning. We also discuss the implications of the recursive principle, limitations of the algorithm, and potential use cases.

中文翻译：

---

有向图哈希

本文提出了一种结构化散列有向图的算法。该算法寻求满足递归原则，即节点的散列应仅取决于其邻居的散列。该算法即使在存在循环的情况下也能工作，这会阻止朴素的递归算法发挥作用。我们还讨论了递归原理的含义、算法的局限性和潜在的用例。