 | 1 | initial version |
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 example which is nice but it is not the same type of problem. How can I use sage to find the longest path?
| | 2 | retagged |
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 example which is nice but it is not the same type of problem. How can I use sage to find the longest path?
Copyright Sage, 2010. Some rights reserved under creative commons license. Content on this site is licensed under a Creative Commons Attribution Share Alike 3.0 license.
