Transitive Closure Of A Graph using Graph Powering

Transitive-closure-Graph-powering


In this article, we will begin our discussion by briefly explaining about transitive closure and graph powering. We will also see the application of graph powering in determining the transitive closure of a given graph.


What is Transitive Closure of a graph ?

In any Directed Graph, let's consider a node i as a starting point and another node j as ending point. For all (i,j) pairs in a graph, transitive closure matrix is formed by the reachability factor, i.e if j is reachable from i (means ther...

 •  0 comments  •  flag
Share on Twitter
Published on August 11, 2020 00:35
No comments have been added yet.