Path calculating method, program and calculating apparatus

• Main Authors: IWATA HIDEAKI, AOKI MICHIHIRO, SUGISONO KOJI
• Format: Patent
• Language: English
• Published: 15.12.2015
• Subjects: ELECTRIC COMMUNICATION TECHNIQUE; ELECTRICITY; TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHICCOMMUNICATION

A calculating apparatus calculates a shortest path connecting two nodes of a network. A shortest-path group, which is a set of shortest paths having node Y as their starting points, can be calculated at once by having calculated a shortest path having node Y as its starting point for each of other nodes. When the shortest-path group having node Y as the starting point is calculated and further if a group of shortest paths having node X as their starting points is stored beforehand in a storing unit, then path portions, which belong to the group of shortest paths having node X as the starting points and further which are paths extending from node Y to the nodes located downstream from node Y, are utilized as part of a result of calculation of the shortest path group having node Y as the starting point.