Oh I think this is just finding the graph diameter
> After all, the definition of the longest possible train journey is “the shortest possible route between the two farthest possible stations.” I’m trying to think, what would be the most efficient way to compute this?…
Oh I think this is just finding the graph diameter
> After all, the definition of the longest possible train journey is “the shortest possible route between the two farthest possible stations.” I’m trying to think, what would be the most efficient way to compute this?…