1. Start from initial/starting point and make it as root and create a list of nodes that are either visited or unvisited. (Size= number of relevant nodes that lead to destination).
2. Initially the starting node is set to current node and list contains all other nodes as unvisited.
3. Trace the current node’s neighbors (adjacent nodes) and calculate the distance from Current node to its neighbors. (using Euclidean formula √(a-b)2 )
4. Add estimated path cost to its value. After traversing mark them as visited also update the list and store its path cost. (Using A* algorithm formula F(X)=G(X) + H(X) Cost function considering approximation algorithm to discard irrelevant route nodes).
5. Select the least cost path value of the visited node that is in list towards the destination node and store its path selection.
6. Repeat Step 3 & 4 till all nodes that are relevant towards the destination point are visited.
7. Highlight the selected path (least cost and highly efficient) and insert it into the table.
8. End the process once Total least cost distance is achieved from source to destination.
9. Backtrack the entire path selection, which is easy because at every step of calculation, each node keeps a track of its predecessor.