One way to solve the Travel Salesman's problem (TSP) is by the cutting plane method, using the following subtour elimination constraint (SEC):

Make an algorihm in python that given a point x* and a graph G checks if there is a SEC violated by x* and in that case outputs any of those