Topology is the blueprint of a directed graph, which serves an application software in answering queries whether two objects represented in the model are related to each other or not. How these relationships manifest themselves either as a fact or as a chain of facts is of particular importance. Another critical issue is to prove that two objects are not related because the proof is only possible if all paths through the graph are known.We propose an iterable algorithm which explicitly reflects, and explicates the graph’s topology and structure.