Minimum Spanning Tree Approach to Path Through K Specified Links

Abstract

This paper presents a minimum spanning tree approach to find a path through ‘k’ specified links. This problem has many real-life applications and unlike the shortest route, the path through specified links may have loops. The proposed method determines the route, which may either be an optimal or a near optimal path. It may also contain loops.