ASKSAGE: Sage Q&A Forum - Latest question feedhttp://ask.sagemath.org/questions/Q&A Forum for SageenCopyright Sage, 2010. Some rights reserved under creative commons license.Fri, 25 May 2012 07:06:58 -0500How to find the path of the maximal distance between two vertices on a complete digraph?http://ask.sagemath.org/question/9000/how-to-find-the-path-of-the-maximal-distance-between-two-vertices-on-a-complete-digraph/I was wondering how can I find the path of the maximal distance between two vertices on a complete digraph.
Suppose the digraph has 5 vertices:
`sage: g = graphs.CompleteGraph(5).to_directed()`
I have seen a [maximal flow](http://www.sagemath.org/doc/thematic_tutorials/linear_programming.html#flows) example which is nice but it is not the same type of problem. How can I use sage to find the longest path?
MaelstromYamatoFri, 25 May 2012 07:06:58 -0500http://ask.sagemath.org/question/9000/