I've made an implementation of the Dijkstra algorithm in Java and I would like to know how to calculate the complexity of the program.
Is it rather a theoretical question or it's enough about code to be on SO?
Some precision :
I will have to post my code in order to provide informations to calculate the complexity of the algorithm and measure the impact of my use of Java object on the complexity.
So what is the more important?
The technical part for calculate the complexity based on Java use? Or the theoretical issue of calculate complexity?