| Input: |
| Geographical map of the spatial extent SE with tourist destinations. |
| Output: |
| Optimized path for tourists to visit various destinations in SE. |
| Procedure: |
| 1. Start |
| 2. Input geographical map of the spatial extent SE with tourist destinations. |
| 3. Create an empty list for nodes. |
| 4. For each tourist destination in SE: |
| a. Create a node for the tourist destination. |
| b. Assign a Degree D to the node. |
| c. Calculate Degree D as the number of streets leading to the destination. |
| 5. Find the node with the highest Degree D and assign it as the Source Node (S). |
| 6. Consider S as the Dominating Node (DN). |
| 7. Create two empty lists for Adjacent Dominating Nodes (ADN) and Non-Adjacent Dominating Nodes (NADN). |
| 8. Construct a Cloud Network with DN, ADN, and NADN. |
| 9. Set the initial orientation direction as 360° from DN. |
| 10. Fix the user orientation direction as 180° from DN. |
| 11. For each ADN in the list: |
| a. Find Nx for the ADN. |
| b. Calculate the distances: |
| i. Distance (d) from DN to ADN. |
| ii. Distance (d) from ADN to NADN. |
| c. Calculate the total distance (Total d). |
| 12. Check the ADN node with the maximum Nx and minimum total d. |
| 13. Assign the selected node as NSNy (next stop node). |
| 14. Alternatively, check the ADN node with the maximum Nx and maximum total d. |
| 15. Assign the selected node as NSNy. |
| 16. Exclude the previous node (if any) as VNx (visited node). |
| 17. Assign NSNy as S, as the new dominating node DN. |
| 18. Repeat steps 7–17 until all nodes are visited or the desired path is complete. |
| 19. Stop. |
