1
I Use This!
Very Low Activity
Analyzed 1 day ago. based on code collected 1 day 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
  • ...
    you can embed statistics from Open Hub on your site
  • ...
    55% of companies leverage OSS for production infrastructure
  • ...
    search using multiple tags to find exactly what you need

Languages

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

30 Day Summary

Jul 20 2017 — Aug 19 2017

12 Month Summary

Aug 19 2016 — Aug 19 2017
  • 0 Commits
    Down -2 (100%) from previous 12 months
  • 0 Contributors
    Down -1 (100%) from previous 12 months

Ratings

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