  Generic Dijkstra is a novel algorithm for finding the optimal shortest path
in both wavelength-division multiplexed networks (WDM) and elastic optical
networks (EON), claimed to outperform known algorithms considerably. Because of
its novelty, it has not been independently implemented and verified. Its time
complexity also remains unknown. In this paper, we perform run-time analysis
and show that Generic Dijkstra running time grows quadratically with the number
of graph vertices and logarithmically with the number of edge units. We also
discover that the running time of the Generic Dijkstra algorithm in the
function of network utilization is not monotonic, as peak running time is at
approximately 0.25 network utilization. Additionally, we provide an independent
open source implementation of Generic Dijkstra in the Python language. We
confirm the correctness of the algorithm and its superior performance. In
comparison to the Filtered Graphs algorithm, Generic Dijkstra is approximately
2.3 times faster in networks with 25 to 500 nodes, and in 90% of calls its
computation takes less time.
