Revision history [back]

From your question I have no idea of what you are looking for..

May it be the diameter of a graph ? http://en.wikipedia.org/wiki/Distance_(graph_theory) Or its longest path ? http://en.wikipedia.org/wiki/Longest_path_problem

One is very easily solved, the other one is NP Hard. And Sage knows how to do both.

Nathann