for max path ? @spaanse
For the longest minimum distance between any pair of nodes
nope for maximum path in graph .
Well, that is a lot more difficult. An algorithm for that does exist in a directed acyclic graph but I don’t know any for a general graph
wrong thread?