Youtor
Data Structure Transitive closure of graph
>> YOUR LINK HERE: ___ http://youtube.com/watch?v=-elv-GJNEYE
This video lecture consist of introduction to transitive closure of graph in Data structure using C. • A detailed example to find transitive closure of a directed graph is also explained. • Transitive Closure it the reachability matrix to reach from vertex u to vertex v of a graph. One graph is given, we have to find a vertex v which is reachable from another vertex u, for all vertex pairs (u, v). • The final matrix is the Boolean type. When there is a value 1 for vertex u to vertex v, it means that there is at least one path from u to v. • This lecture will help engineering students(B.Tech and B.E.). • For more lectures on Data Structures visit the following Playlist: • Data Structure using C: • Data Structure using C
#############################
