Introduction - If you have any usage issues, please Google them yourself
The program is based on Floyd shortest path algorithm optimization, where only a small number of nodes in a presentation case. Shortest path marked with red, click on a node on the shortest path (ie, the node fails), the program will automatically update the shortest path.