In Python, generate a random path for the TSP according to transition probabilities

For the travelling salesman problem (TSP), I would like to generate in Python a random tour (where each node from a set of n is visited only once) from a state-transition matrix M (n x n), for which M[i,j] contains the probability that the shortest global path connects node i to node j.

Anyone knows how to do that in Python?