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 ? Thanks, Claude
<https://www.avast.com/sig-email?utm_medium=email&utm_source=link&utm_campaign=sig-email&utm_content=webmail> Garanti sans virus. www.avast.com <https://www.avast.com/sig-email?utm_medium=email&utm_source=link&utm_campaign=sig-email&utm_content=webmail> <#DAB4FAD8-2DD7-40BB-A1B8-4E2AA1F9FDF2>
_______________________________________________ igraph-help mailing list [email protected] https://lists.nongnu.org/mailman/listinfo/igraph-help
