Open Source

Two hotfix releases of Fahrplan

Submitted by Oleksii Serdiuk on

Two new releases of Fahrplan were released yesterday. Version 2.0.22 was already approved in all relevant app stores. Version 2.0.23 is still in the review process for BlackBerry World and Jolla Store.

Both of them are hotfixes for broken bahn.de service. So if you were getting “Unknown error occurred with the backend (error 12)” error message, be sure to go and update Fahrplan.

Except for the fix of bahn.de, version 2.0.22 contains an improved About page.

Tags: 

Qt Creator

Cross-platform integrated development environment

Description: 

Qt Creator is a cross-platform integrated development environment (IDE) tailored to the needs of Qt developers. Qt Creator runs on Windows, Linux/X11 and Mac OS X desktop operating systems, and allows developers to create applications for multiple desktop and embedded device platforms.

My contribution: 

  • Modified CMake plugin to work correctly with RemoteLinux plugin
  • Added possibility to ignore missing files while deploying with Remote Linux plugin
  • Few very small bugfixes

Tags: 

Fahrplan

A journey planner and timetable application

Description: 

A journey planner and timetable application for a lot of train and public transport lines in Europe, USA and Australia.

My contribution: 

One of the project maintainers. Active participation in the project development and improvement, Symbian port, BlackBerry 10 port, bugfixes.

Tags: 

TAO Translator

Online translator with some advanced features

Description: 

TAO Translator uses online translation services to provide translations. It supports Google Translate, Microsoft Translator (a.k.a. Bing Translator), Yandex.Translate, and Yandex.Dictionaries services. More services might be added in future.

My contribution: 

I am the author of this project.

Tags: 

TSP Solver and Generator

Generate and solve Travelling Salesman Problems

Description: 

TSP Solver and Generator is intended to generate and solve Travelling Salesman Problem tasks. It uses 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.

My contribution: 

I am the author of this project. The project is currently “on hold” due to the lack of my spare time. But it will be revived, eventually.

This project was originally born as an Open Source rewrite of my University coursework Branch and bound method of solving Travelling Salesman Problem.

Tags: 

Pages

Subscribe to RSS - Open Source