Abstract:
The development of efficient algorithms to
determine path existence between vertices in a directed
graph has attracted a large amount of research efforts
due to the important role of these algorithms in many
application domains, including deductive databases,
rule bases verification, and graph theory to name a few.
These algorithms are very crucial to answer certain
queries about the path existence between any two graph
vertices. This paper presents an efficient algorithm to
determine the path existence between graph vertices by
utilizing a special matrix representation of the graph.
