Generate and solve Travelling Salesman Problem tasks
TSPSG is intended to generate and solve Travelling Salesman Problem (TSP) tasks. It uses Branch and Bound method for solving. An input is a number of cities and a matrix of city-to-city travel prices. The matrix can be populated with random values in a given range (useful for generating tasks). The result is an optimal route, its price, step-by-step matrices of solving and solving graph. The task can be saved in internal binary format and opened later. The result can be printed or saved as...
This kit holds the resources to learn and build mobile apps
Ultimate Mobile development kit has collections of tools, resources, tips and tutorials to start building mobile applications for major mobile platforms like Android, Blackberry, Windows, Meego and Cross Platform. Updated as and when possible to include latest files