Implement Travelling Salesman Problem (TSP) in python using the greedy algorithm where the input can be specified as an undirected weighted graph. Then, come up with a greedy solution that starts at a random node and select an adjacent lowest weight edge to a node that has not visited yet.