Main Article Content
An empirical time complexity analysis for a class of graph route problems
Abstract
In this paper, we investigate Empirical Time Complexity of a Modified Dijkstra algorithm for the multi-source to multi-destination problem. We use the Netbeans profiler tool in Java language to perform several runs on an experimental data-set derived with GPS and processed with Arc-Map Software. From the means plot of the runs, it was observed that the model has an experimental linear time complexity with a slightly better running time than Standard Dijkstra Algorithm.
Key-words: Empirical Time Complexity, Modified Dijkstra-Algorithm, Multi-Source to Multi-Destination