Hello to all,
I have a directed graph. Each vertex has a direct connection with any other one, the weigth of the edge between them makes the difference.
Given a subset of vertices (A,B, C, D,..., Z), I want to determine the shortest path that goes through all these vertices, i.e; the order between my selected vertices, that will minimize the sum of weights of edges.
Is there a function in igraph that will give me that ? or a simple way to get the result ?