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}, 
}