Hi everyone,

I'm currently working on an algorithm aiming to find the best route between two vertices (the best, not the shortest...)

My hypothesis :

- G a graph

- each vertex is graded (a grade out of 10 for example)

- the edges are also weighted

- we call "mean of a path" the arithmetical mean of all the grades of the vertices of the path

The problem is to find the best (i.e. the path that has the highest mean) between two given vertices A and B

Do you have any recommandations for me ? Any ideas (of related fields or problems for example...)

Thank you for your help