I hope this notice finds you well. My name is Mac Gagne and I'm a current employee of Northrop Grumman's Future Concept's team. One of our currenct projects is currently utilizing your NetworkX Dijkstra algorithm in python to aid in operational work pertaining to satellite communications. As our team always likes to stay on top of developments in the space and modeling spheres, we've recently learned about developments in the gradient descent algorithm (
as highlighted in the following Quanta Magazine article). From our understanding of this news, the gradient descent algorithm (which, if we're not mistaken, your Dijkstra algorithm employs) has been found to cover a number of edge cases not previously considered. As such, we wanted to reach out and ask your team if these recent developments and changes to the gradient descent algorithm have been incorporated into the Dijkstra algorithm. Our team wants to make sure we're using the most developed form of gradient descent, and we'd love to know if these recent developments in the scientific field have had an impact on the great work NetworkX is advancing. Any information, guidance, or advice on this topic would be much appreciated.