1
I Use This!
Activity Not Available
Analyzed 7 months ago. based on code collected 7 months ago.

Project Summary

TSPSG is intended to generate and solve Travelling Salesman Problem (TSP) tasks. It uses the Branch and Bound method for solving. Its input is a number of cities and a matrix of city-to-city travel costs. The matrix can be populated with random values in a given range (which is useful for generating tasks). The result is an optimal route, its price, step-by-step matrices of solving, and a solving graph. The task can be saved in an internal binary format and opened later. The result can be printed or saved as PDF, HTML, or ODF.

TSPSG may be useful for teachers to generate test tasks or just for regular users to solve TSPs. Also, it may be used as an example of using Branch and Bound method to solve a particular task.

Tags

algorithms c++ education gpl gplv3 graph learning math mathematics maths open_source qt qt4 qt5 testing university

Badges

In a Nutshell, TSP Solver and Generator...

This Project has No vulnerabilities Reported Against it

Did You Know...

  • ...
    Black Duck offers a free trial so you can discover if there are open source vulnerabilities in your code
  • ...
    compare projects before you chose one to use
  • ...
    there are over 3,000 projects on the Open Hub with security vulnerabilities reported against them
  • ...
    you can subscribe to e-mail newsletters to receive update from the Open Hub blog

Languages

Languages?height=75&width=75
C++
64%
C
18%
HTML
11%
3 Other
7%

30 Day Summary

Oct 5 2016 — Nov 4 2016

12 Month Summary

Nov 4 2015 — Nov 4 2016
  • 2 Commits
    Down 0 (0%) from previous 12 months
  • 1 Contributors
    Down -1 (50%) from previous 12 months

Ratings

Be the first to rate this project
Click to add your rating
   Spinner
Review this Project!