Wang Hong-shan
Abstract
A method to find the transitive closure of a relation on a finite set by computing its matrix are introduced in this paper. It is easy and useful. We can also compute reachability matrix of a digraph by this method.
A significance statement is not available in the OpenAlex record.
A contribution statement is not available in the OpenAlex record.
Method details are not available in the OpenAlex metadata.
Findings are not separately available in the OpenAlex metadata.
Limitations are not available in the OpenAlex metadata.
Application details are not available in the OpenAlex metadata.
A method to find the transitive closure of a relation on a finite set by computing its matrix are introduced in this paper. It is easy and useful. We can also compute reachability matrix of a digraph by this method.
Key concepts: Transitive closure, Digraph, Reachability, Transitive relation, Closure (psychology), Transitive reduction, Relation (database), Matrix (chemical analysis)