Thomas

Sorry for the waiting I was in holidays. ok, I made some test and dig into PCL conversions: - convert to PCL: this requires a very specific padding After some...

Hi, here is some hint [https://www.quora.com/How-does-following-algorithm-for-finding-longest-path-in-tree-work](https://www.quora.com/How-does-following-algorithm-for-finding-longest-path-in-tree-work) but as you can see it's for a tree, not a graph. but as it's using BFS, it is like going through a tree...

My bad it doesn't work see https://cs.stackexchange.com/questions/194/the-time-complexity-of-finding-the-diameter-of-a-graph. But we might find a way to test this case by choosing another starting node not in the chain of the diameter or...