An interface that must be implemented by a class that will manage the order of processing of tasks while finding the connections for the travel divisions.
Draws a line on the given graphics between the two specified points taking into account the fact that the West and East edges are the single edge (roundness of the world).
Draws a string on the given graphics in the middle between the two specified points taking into account the fact that the West and East edges are the single edge (roundness of the world).
Gets a list of at most connectionsCountLimit possible connections leaving from the given station not before the given time limit with the minimal time spans between the time limit and the departure time.
Defines a maximal number of change connections when searching for some other changes if there where none
matching the travel constraints, but there are still some with a change time longer then the max change time.
Defines a maximal number of connections taken into account when starting the search for the connections leaving from the first station of the whole travel.
An interface that must be implemented by a class that will provide a list of means of transportation appropriate for the main part of travek between the two given locations.
Removes from the given list of solutions similar ones (with the same routes and time of start and end, but with different times between the start and the end).