Can someone give me some guidance. I'm looking for the right algorithm to use when solving this problem. I want to find the distance and shortest path to 11 schools for about 15,000 students. Does the many to many flavor of dijkstra scale up to these numbers? Is there a better way to solve this?

Can someone give me some guidance. I'm looking for the right
algorithm to use when solving this problem. I want to find the
distance and shortest path to 11 schools for about 15,000 students.
Does the many to many flavor of dijkstra scale up to these numbers?
Is there a better way to solve this?

Regarding performance, that depends on a lot of issues but I would think if your limiting your edge table to the roads in the school district that you should get reason able performance.

You might want to try running it with 10, 100, 1,000, 15,000 so you have some idea of the performance at various numbers of nodes.

you will need to map the locations to the node ids in the network, then pass the node ids to the function.

Can someone give me some guidance. I’m looking for the right
algorithm to use when solving this problem. I want to find the
distance and shortest path to 11 schools for about 15,000 students.
Does the many to many flavor of dijkstra scale up to these numbers?
Is there a better way to solve this?

Regarding performance, that depends on a lot of issues but I would think if your limiting your edge table to the roads in the school district that you should get reason able performance.

You might want to try running it with 10, 100, 1,000, 15,000 so you have some idea of the performance at various numbers of nodes.

you will need to map the locations to the node ids in the network, then pass the node ids to the function.

Can someone give me some guidance. I’m looking for the right
algorithm to use when solving this problem. I want to find the
distance and shortest path to 11 schools for about 15,000 students.
Does the many to many flavor of dijkstra scale up to these numbers?
Is there a better way to solve this?

Regarding performance, that depends on a lot of issues but I would think if your limiting your edge table to the roads in the school district that you should get reason able performance.

You might want to try running it with 10, 100, 1,000, 15,000 so you have some idea of the performance at various numbers of nodes.

you will need to map the locations to the node ids in the network, then pass the node ids to the function.