I have implemented an approximation algorithm for computing the diameter of unweighted graphs based on this paper and have submitted a PR for review. I would appreciate any feedback or suggestions for improvement.
Additionally, I plan to build on this work for GSoC 2025. This algorithm is well-suited for parallelization using joblib, as suggested in issue #82.
Looking forward to your thoughts!
Best,
Rajendra