Sequential and parallel solutions for the Hamiltonian cycle problem.
-
Updated
Aug 24, 2020 - C++
Sequential and parallel solutions for the Hamiltonian cycle problem.
Given a warehouse layout represented by an undirected graph, a delivery robot must visit all locations exactly once before returning to the home location. The robot has a limited battery life and must complete the circuit within a specified time limit, considering both delivery and travel times.
Add a description, image, and links to the hamilton topic page so that developers can more easily learn about it.
To associate your repository with the hamilton topic, visit your repo's landing page and select "manage topics."