International Journal of Computer Science Issues

More than a traditional journal...

computing transitive closure of graphs is a well-studied area of computer science. In literature different researchers applied different techniques for finding transitive closure of some arbitrary graph. There also exist some good algorithms dealing with this kind of problem like Warshalls algorithm etc. Finding transitive closure in some graph has numerous application starting from computer network design to analysis of molecular interaction. In this paper problem of finding transitive closure of graph is formulated in reach-ability matrix form. Here basic problem of finding transitive closure is dealt with Max-Plus Idempotent semi-ring and Idempotent Mathematics. A simple algorithm is described that can calculate transitive closure of graphs using Path Algebra or MaxPlus Algebra. Simple methods of linear algebra is used for different level of computation.