CF1927F Microcycle

Given an undirected weighted graph with $ n $ vertices and $ m $ edges. There is at most one edge between each pair of vertices in the graph, and the graph does not contain loops (edges from a vertex to itself). The graph is not necessarily connected. A cycle in the graph is called simple if it doesn't pass through the same vertex twice and doesn't contain the same edge twice. Find any simple cycle in this graph in which the weight of the lightest edge is minimal.

N/A

N/A