Anmol Chaddha chanmol1999

## GSoC_2020_Work_Report.md

      
              1 file
            
          
              0 forks
            
          
              0 comments
            
          
              1 star
            
          
                chanmol1999
                / GSoC_2020_Work_Report.md
            
            
              Last active
              September 1, 2020 02:14
            
              
                GSoC 2020 Work Submission
              
          
GSoC 2020 SUBMISSION REPORT


Student
Anmol Chaddha


## traveling_salesman.cpp
#include <vector>
#include <iostream>

using namespace std;

/**
    \brief Given a complete, undirected, weighted graph in the form of an adjacency matrix,
           returns the smallest tour that visits all nodes and starts and ends at the same
           node. This dynamic programming solution runs in O(n^2 * 2^n).
	#include <vector>
	#include <iostream>

	using namespace std;

	/**
	\brief Given a complete, undirected, weighted graph in the form of an adjacency matrix,
	returns the smallest tour that visits all nodes and starts and ends at the same
	node. This dynamic programming solution runs in O(n^2 * 2^n).