I’m using python 2.7 with igraph 0.8

Given some groups of vertexes that I want to find the shortest path between all of the groups.

(Assuming that there is a path)

I need only one path between one group to another.

for example:

group one: start node

group two: [node_5, node_10]

group three: [node_6, node_9]

If the length of: [strat node -> … -> node_5 -> … -> node_9] is the shortest - return it

If the length of: [strat node -> … -> node_10 -> … -> node_9] is the shortest - return it

etc.

I have started with a very basic algorithm that searches for the closest vertex to the start point and then recursively searches for the closest vertex from the other groups. It doesn’t return the shortest path (of course).

Is there a ready function or easy way with other function to achieve this in igragh?