最短経路計算機 for PC

This is a shortest route calculation application using Dijkstra's method.
For example, a route map is called a network, each station on it is called a node, and the tracks that connect stations are called lines.
- After starting up, first register all the nodes that exist in that network, then press "Next".
- Set the starting point node and destination point node on the next screen.
-Next, a list of nodes that will be the starting point of the line will be displayed, so select them in order from the top.
・When selected, a list of lines with that node as the starting point and other nodes as the ending point will be displayed.Select the line that has the starting point and the adjacent node as the ending point, and on the next screen, enter the cost and (if necessary) ) Enter notes.
Line: "Start point ⇒ End point (adjacent node)"
In addition, please ignore nodes (end points) that are not adjacent to the start point in the line list without selecting them.
- After dealing with all lines, press the "Calculate" button and the shortest route will be displayed.
- You can save and load from the menu.