At present communication and transportation has an important place in every person life in their all business and non-business task. In daily life everybody is facing a problem of choosing a shortest path from one location to another location. Shortest path means the path which has minimum mileage or distance covered. It saves time and money both which are essential parts of our life. In this paper, we want to propose a technique to resolving this problem by traversing the whole network and finding the distance of individual node from the source node. Then we get its spanning tree and also get the shortest path by the spanning tree from source node to destination node.
展开▼
