Hi, this is my first time writing here. I've recently gotten into algorithms (2.5-3 months ago) and I've started learning Floyd Warshall a few days ago. One problem I've found on CP Algorithms (regarding this topic) is Traveling Graph (21D) here on CF. I've done the FW for the shortest path and found a way to tell if there is no solution at all, but that's as far as I've gotten. I've been challenging myself for four days but after some research today I found out it is similar to Traveling Salesman problem — is this the write way to approach the problem or is there a way to do it using Floyd's algo, if so could you elaborate on it further? Thanks.

Problem Link: https://mirror.codeforces.com/problemset/problem/21/D