id,summary,reporter,owner,description,type,status,priority,milestone,component,resolution,keywords,cc,merged,author,reviewer,upstream,work_issues,branch,commit,dependencies,stopgaps
17410,unambiguously doctest longest_path(),charpent,,"A doctest or longest_path() is ambiguous :
{{{
sage: l = [(0, 1), (0, 3), (2, 0)]
sage: G = DiGraph(l)
sage: G.longest_path().edges()
[(0, 3, None), (2, 0, None)]
}}}
Starting with sage 6.5beta1, sage gives the equally valid answer
{{{
[(0, 1, None), (2, 0, None)]
}}}
but this is detected as a failure by sage ptestlong.
So let's use a problem with a unique solution.",defect,closed,trivial,sage-6.5,graph theory,fixed,,,,Emmanuel Charpentier,Vincent Delecroix,N/A,,52c5c08ea0e189c25b2513f80a0355ecb421c713,52c5c08ea0e189c25b2513f80a0355ecb421c713,,