// Suggerimento iniziale
function findHamiltonianCycle(graph) {
    const path = [];
    
    function backtrack(vertex, visited) {
        if (path.length === graph.length) {
            return graph[vertex].includes(path[0]);
        }
        
        for (const neighbor of graph[vertex]) {
            if (!visited.has(neighbor)) {
                visited.add(neighbor);
                path.push(neighbor);
                
                if (backtrack(neighbor, visited)) {
                    return true;
                }
                
                visited.delete(neighbor);
                path.pop();
            }
        }
        
        return false;
    }
    
    path.push(0);
    return backtrack(0, new Set([0]));
}