IMPLEMENTATION OF PRESUMPTIONS USING DFS_h IN A CASE STUDY

Abstract

The research work in this thesis provides an idea to make presumptions and take a case study of railway reservation system to apply idea of presumptions using hMetis and DFS_h algorithm. These are used because these can very efficiently divide and traverse the graph. First divide the graph with the help of hMetis and then traverse the graph with the help of DFS_h Algorithm .With the help of few modifications, we can restrict the traversing for adjacent node each adjacent of node traverse up to two nodes only and then return to original node. With the help of this process, also we can reduce the database size. After dividing and traversing the graph, the root or path from source to destination node can be easily found .Then, how many trains are available on particular path are available can be found and the availability of the seats can also be checked. If there is waiting in the availability of seats, then we analyse all five scenarios which are given in thesis and with the help of presumptions make reservation system very efficient.