search

fnplus / interview-techdev-guide

This repository contains curated technical interview questions by fn+geeks community
http://bit.ly/fnplusnow
MIT License
318 stars 325 forks source link

Travelling_Salesman_Problem.cpp Add Greedy Algorithm #620

Closed HunainHumail closed 4 years ago

HunainHumail commented 4 years ago

This adds Travelling Salesman Problem which is a Greedy Algorithm used to calculate the shortest route to cover all the cities and return back to the origin city. This method is use to find the shortest path to cover all the nodes of a graph.