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 the Branch and Bound method to solve a particular task.
Samurai Kanji a flash-card application for memorizing kanji. It is inspired by "Remembering the Kanji I" by James Heisig. It can run on any PDA or mobile device running PalmOS, SymbianOS, or Windows CE. What primarily makes this different from other, similar applications is that the kanji are divided into the same lessons that Heisig uses in his book. The user can then choose which lessons to drill on as the user progresses through the book.