greedy algorithm for TSP

Hello
I want to implement greedy algorithm for solving travelling salesman problem and really I face problem in implementing this in java I want to find all suboptimal solutions I mean if two cities(a, b) have the same distance the first suboptimal must take city a and from city a taking the next near city and the second optimal solution is taking city b and then taking near city to b and so on

I have tried for about 3 days and I really feel upset

I have made the solution that just take one solution and ignore the remaining but really I want to find all optimal solutions

I really need your advice how to do it

thanks alot