README.txt

0. This is the source code of the paper "An efficient implementation for solving the all pairs minimax path problem in an undirected dense graph."
 
1. License.
   
License of the source code : Apache License, Version 2.0
License of new data: Creative Commons Attribution 4.0 International

2. Citation:
 
@article{liu2024efficient,
      title={An efficient implementation for solving the all pairs minimax path problem in an undirected dense graph}, 
      author={Liu, Gangli},
      journal={arXiv preprint arXiv:2407.07058},
      year={2024},
      url={https://arxiv.org/abs/2407.07058}, 
}

3. The formal name of Algorithm 4 is "Gangli's Algorithm 4 (MMJ distance by Calculation and Copy)." My other algorithms are named in a similar manner, such as Algorithm 1 (MMJ distance by recursion), Algorithm 7 (warm-start calculation of shortest path), and Algorithm 13 (APPD accelerated by parallel computing).