{"push_id":606796169,"size":1,"distinct_size":1,"ref":"refs/heads/master","head":"50d91f381af2d55159fe912a4f2b88333d03400a","before":"cb44d9ed895f0352cea445e378e9d773e8999898","commits":[{"sha":"50d91f381af2d55159fe912a4f2b88333d03400a","author":{"email":"05856cf2f8c9ac998ec26d0f3900e6887c7ccb8c@gmail.com","name":"Saurabh Netravalkar"},"message":"Travelling Salesman Solution by Dynamic Programming\n\nElegant Time-Space Optimized Dynamic Programming Solution to the\nNP-Complete Travelling Salesman Problem. The Algorithm runs in\nO(n*n*2^n), blazingly faster than Brute Force algorithm which runs in\nO(n!) time.","distinct":true,"url":"https://api.github.com/repos/SaurabhNetra/C_ImplementationsOfAlgorithms/commits/50d91f381af2d55159fe912a4f2b88333d03400a"}]}