Skip to content

zena123/Transitive-Clousre

Folders and files

NameName
Last commit message
Last commit date

Latest commit

 

History

3 Commits
 
 
 
 

Repository files navigation

Transitive-Clousre

4th year project at Tishreen University

Given a directed graph, find out if a vertex j is reachable from another vertex i for all vertex pairs (i, j) in the given graph.
Here reachable mean that there is a path from vertex i to j.
The reach-ability matrix is called the transitive closure of a graph.

For more information

About

4th year project at Tishreen University

Topics

Resources

Stars

Watchers

Forks

Releases

No releases published

Packages

No packages published

Languages