Directed graph algorithms for tours - a case study
N. Subadra, Cheng Rao, M. Bhagavan Das · Journal of Emerging Trends in Engineering and Applied Sciences · 2011
In this article, we consider graph theory applications to find out the path of a real world problem. When dealing with a real world problem the most adequate algorithm has to be chosen in order to solve the given problem in the most efficient way. We apply four algorithms separately for the problem and find out the shortest path by using these algorithms. Lastly we compare the paths that we get by these algorithms with the solution we get by assignment problem. The main purpose of this research is to find out which algorithm is suitable out of all algorithms.