Representing pre-trip transit information as graph with constraints

This research explores the representation of pre-trip transit information as graph with constraints. The research is aimed at representing pre-trip transit information for flight travelers that is able to suggest a number of continuous travel destinations within a route to travelers. It applies maximal join concept to merge multiple transit information network which is applied to centralize distributed travel destinations. Graph similarity concept is applied to determine transit node and alternative edges between two nodes. The research also applied Constraint Satisfaction Problems to produce only relevant information to travelers which suggest a destination series to them.