Test suite for algorithms computing all-pairs shortest path problem, used for learning and implementing r-Kleene algorithm. For reference Floyd-Warshall algorithm was implemented.
Implementation should be made in RKleene.computeShortestPaths method.
Matrix requirements:
- it should be square
- the dimension should be a power of two.
Presentation (in polish) available here: https://slides.com/karrith/rkleene_tpa
Solution (definitely not optimal and most elegant) is available on branch "mkromka".
Prepared for Towarzystwo Przyjaciół Algorytmów #4