#19227: Graphs: DFS and broken distance-parameter
-------------------------------------+-------------------------------------
Reporter: jmantysalo | Owner:
Type: defect | Status: needs_review
Priority: major | Milestone: sage-6.9
Component: graph theory | Resolution:
Keywords: | Merged in:
Authors: | Reviewers:
Report Upstream: N/A | Work issues:
Branch: | Commit:
u/jmantysalo/graphs__dfs_and_broken_distance_parameter|
89b7490bec7e28f1c63bb81603eeab69fefb4e65
Dependencies: | Stopgaps:
-------------------------------------+-------------------------------------
Comment (by dcoudert):
Now I agree that not only we don't have a proper definition, but also that
the result is machine-dependent.
on my mac:
{{{
sage: 42>'hello!'
True
}}}
on a linux desktop I have
{{{
sage: 42>'hello!'
False
}}}
Could you:
- add your name as author
- change in the ticket description, `This should output` -> `This could
output`.
- To show that the DFS can go backward, you could provide a simpler (and
machine-independent) example, instead of this of `sorted([d_in.next(),
d_in.next(), d_in.next()])`:
{{{
sage: D = digraphs.Path(10)
sage: list(D.depth_first_search(5, neighbors=D.neighbors_in))
[5, 4, 3, 2, 1, 0]
sage: list(D.depth_first_search(5, neighbors=D.neighbors_out))
[5, 6, 7, 8, 9]
}}}
Thanks.
David.
--
Ticket URL: <http://trac.sagemath.org/ticket/19227#comment:9>
Sage <http://www.sagemath.org>
Sage: Creating a Viable Open Source Alternative to Magma, Maple, Mathematica,
and MATLAB
--
You received this message because you are subscribed to the Google Groups
"sage-trac" group.
To unsubscribe from this group and stop receiving emails from it, send an email
to [email protected].
To post to this group, send email to [email protected].
Visit this group at http://groups.google.com/group/sage-trac.
For more options, visit https://groups.google.com/d/optout.
