Research of an event process designed for event & voluminous graphs to compute customized itinerary

Processes of itinerary calculation in graphs have been, and still are, an interesting research topic. Despite the great interest that this topic has drawn in the research community, the proposed algorithms in the literature reveal certain limits to compute the itinerary in the graphs which parameters (vertices, edges) could be varying and could have a big graph order. The purpose main of this paper is to present the solution that resolve the issue in question and final results will be operated for the benefit of humans (included people with visual, auditory and mobile disabilities) to guide them in the presence of the unexpected of navigation that cause the variability of graph parameters. The presented solution can also be operated in a wide range of applications fields.