LaPath
Learning Automata algorithm for the shortest path problem.
...In the context of network routing, LA residing at intermediate nodes along a path, exploit feedback from the destination node for reducing, e.g., path's length. According to topology’s resources like the node and edge numbers, the proper number of iterations must be used. More iterations lead to paths with higher probability of being optimal but more computing resources are consumed.
Development takes place at https://github.com/zfoxer/LaPath