Path search apparatus, path search method, and program

A route search method performed by a computer including a memory and a processor, the route search method comprising:

• dividing a communication network including a plurality of nodes and an edge connecting the nodes into a plurality of areas based on information indicating communication demand of the nodes, and creating a first network graph that represents a connection relationship between the areas;
• searching for one or more first routes from a start point area including a start point node to an end point area including an end point node using the first network graph;
• and
• searching for one or more second routes from the start point node to the end point node using a second network graph that represents a connection relationship between the nodes and the edge in areas included in the first routes,
• wherein, in dividing the communication network into the plurality of areas, the route search method further comprises selecting nodes, among nodes that do not belong to any area, in descending order of communication demand and form an area by grouping the selected node together with nodes located within a predetermined range from the selected node.

A non-transitory computer-readable recording medium having computer-readable instructions stored thereon, which, when executed, cause a computer including a memory and processor to perform processing, the processing comprising:

• dividing a communication network including a plurality of nodes and an edge connecting the nodes into a plurality of areas based on information indicating communication demand of the nodes, and creating a first network graph that represents a connection relationship between the areas;
• searching for one or more first routes from a start point area including a start point node to an end point area including an end point node using the first network graph;
• and
• searching for one or more second routes from the start point node to the end point node using a second network graph that represents a connection relationship between the nodes and the edge in areas included in the first routes,
• wherein, in dividing the communication network into the plurality of areas, the processing further comprises selecting nodes, among nodes that do not belong to any area, in descending order of communication demand and form an area by grouping the selected node together with nodes located within a predetermined range from the selected node.