0

Hi, i am trying to make an algorithm that will read the nodes of a graph. Then i should find the shortest path that i have to follow in order to pass from all the nodes.

I am trying to make it so the algorithm will calculate every possible path and then it will output the shortest.

Is there any way to make an algorithm to calculate this?

Thanks in advance.