Transitive closure according to Roy-Floyd-Warshall
نویسنده
چکیده
This formulation of the Roy-Floyd-Warshall algorithm for the transitive closure bypasses matrices and arrays, but uses a more direct mathematical model with adjacency functions for immediate predecessors and successors. This can be implemented efficiently in functional programming languages and is particularly adequate for sparse relations.
منابع مشابه
Using basis dependence distance vectors in the modified Floyd-Warshall algorithm
In this paper, we present a modified Floyd–Warshall algorithm, where the most time-consumingpart—calculating transitive closure describing self-dependences for each loop statement—is computed applying basis dependence distance vectors derived from all vectors describing self-dependences. We demonstrate that the presented approach reduces the transitive closure calculation time for parameterized...
متن کاملOn the Floyd-Warshall Algorithm for Logic Programs
We explore the possibility of evaluating single-rule Datalog programs eeciently and with logarithmic work space by a natural extension of the Floyd-Warshall algorithm for transitive closure. We characterize exactly the single rule chain programs that can be so evaluated: they are rather modest generalizations of the transitive closure. The proof relies on an interesting language-theoretic conce...
متن کاملFrom Proofs to Programs in the Minlog System the Warshall Algorithm and Higman's Lemma
The Warshall algorithm computing the transitive closure of a relation is extracted from a constructive proof that repetitions in a path can always be avoided. Secondly a nonconstructive proof of a special case of Higman's lemma is transformed into a constructive proof. From the latter an eecient program is extracted. Both examples are implemented in the interactive theorem prover Minlog develop...
متن کاملTransitive closure and metric inequality of weighted graphs: detecting protein interaction modules using cliques
We study transitivity properties of edge weights in complex networks. We show that enforcing transitivity leads to a transitivity inequality which is equivalent to ultra-metric inequality. This can be used to define transitive closure on weighted undirected graphs, which can be computed using a modified Floyd-Warshall algorithm. These new concepts are extended to dissimilarity graphs and triang...
متن کاملFast algorithms for anti-distance matrices as a generalization of Boolean matrices
We show that Boolean matrix multiplication, computed as a sum of products of column vectors with row vectors, is essentially the same as Warshall’s algorithm for computing the transitive closure matrix of a graph from its adjacency matrix. Warshall’s algorithm can be generalized to Floyd’s algorithm for computing the distance matrix of a graph with weighted edges. We will generalize Boolean mat...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Archive of Formal Proofs
دوره 2014 شماره
صفحات -
تاریخ انتشار 2014