COMPARATIVE STUDY OF MINIMAL SPANNING TREE ALGORITHM AND FLOYDS ALGORITHM USED IN SHORTEST PATH PROBLEM.

Abstract

The report is concerned with shortest path problem. It concentrates on two shortest path algorithms. That are Floyd's algorithm and minimal spanning tree algorithm. The first algorithm finds the shortest path by using weights. The travelling salesman problem arises in many different contexts. In this paper we report on typical applications in Telecommunications, Crew scheduling problem, Drilling of printed circuit boards, X-ray crystallography, and Vehicle routing. Most applications originated from real world problems and thus seem to be of particular interest.