You are given an undirected graph consisting of ????
vertices and ????
edges. Your task is to find the number of connected components which are cycles.

I’m working on a program to find an optimal travel route starting and ending at the same city. The goal is to find the best route with the best goodness rating of the visited cities. My data is read correctly from an Excel file, but the algorithm doesn’t seem to return any results. Here’s the relevant parts of my code: