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
... [More] 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. [Less]
TAO Translator uses available online translation services to provide translations.
Currently supported services:
* Google Translate - supports translation, language detection, dictionary and reverse translations for single words.
* Microsoft Translator (a.k.a. Bing Translator) - supports
... [More] translation only.
* Yandex.Translate - supports translation and language detection.
* Yandex.Dictionaries - only dictionary is supported.
More services might be added in future. [Less]
This is a Telegram bot for Firefly III, which you can use to submit your expenses on the go. You start entering a transaction by sending an amount and a description (e.g., '5 Coffee with friends'). Afterwards, Telefly III will ask you about the destination account, category, and budget. These will
... [More] be fetched from your Firefly III installation and presented as a list of buttons. In case of destination account and category, you can either select an option from the list, or you can type your answer directly. If there's no such account or category, it will be created automatically. As for the budget, you can only select the one from the list. There's also an option not to specify category or budget by selecting (none). [Less]
This site uses cookies to give you the best possible experience.
By using the site, you consent to our use of cookies.
For more information, please see our
Privacy Policy