Comments by Alexandre Cornet (Top 5 by date)

Yes this is what I am saying...
"In graph theory, the shortest path problem is the problem of finding a path between two vertices (or nodes) in a graph such that the sum of the weights of its constituent edges is minimized"

by shortest path I meant : the path with the least weight not the least edges.

Such loops may exists but I am only looking at path with a finite number of edges. Therefore I would have guessed that because of this finite number of edge constraint this kind of loop would not be a problem.

You have to explain me how there can be an infinite loop with only N edges ;)
Maybe I forgot to precise that N is a finite natural number...
thanks anyway.