Community detection for selected nodes

I'm new to graph theory and reached a point of doing community detection successfully.My next problem is to perform a community detection for specific nodes on the network (dividing set of nodes on the network into communities).

To understand the needs, i do have a a network of all roads in a city. Also, I have 5 buses and need to deliver workers to 50 (lets say +/- 10) dynamic locations. Each morning, i need to assign workers to clients and to buses as well. My goal is to minimize travel distances.

I'm looking for guides to algorithms or methods in order to reach such a goal.FYI, I have access to networkx and igraph as well.