Benchmark the algorithms

[jordanmontt]

It is important to benchmark the algorithms

• To see where are our bottlenecks and know what we can improve. I'm thinking on the use of data structures for example.

Also we need to benchmark our algorithms against industrial implementation to see how we are positioned against those

[nikhil061102]

Hello Sir, Firstly, I believe we can look into theoretically graph theory to ensure that we are implementing the algorithms with best possible computational complexity.
Secondly, we can check what other organizations are doing and how differently (or more efficiently) are they implementing the same algorithms. For example - I found from my research that NetworkX is a python library which provides support for graph related algorithms. They have implemented almost all the algorithms which we can look into. Thirdly, I believe like you said we can focus more into testing the algorithms rigorously. Fourthly, I think that we should not shy away from unconventional ways of implementing the algorithm. For example - if we are using LinkedList in some certain algorithm, then we can also try using arrays or any other collections. Then we can test the speed of the different implementations of the same algorithm.
Thank you :)

[jordanmontt]

Hello @nikhil061102 Yes indeed! Feel free to open issues or do Pull Request. You can add this points to your proposal.