#19197: LatticePoset: add breadth()
-------------------------------------+-------------------------------------
Reporter: jmantysalo | Owner:
Type: enhancement | Status: needs_review
Priority: major | Milestone: sage-6.9
Component: combinatorics | Resolution:
Keywords: | Merged in:
Authors: Jori Mäntysalo | Reviewers:
Report Upstream: N/A | Work issues:
Branch: | Commit:
u/jmantysalo/latticeposet__add_breadth__|
33610ad2c4327679b8dfc1d3af445fe4d9080e4a
Dependencies: | Stopgaps:
-------------------------------------+-------------------------------------
Comment (by ncohen):
> I can see nothing complicated here, except maybe on terms to use.
Let us say that you have a path of length 10 on {0,1,...,9}, and that you
add a path of length 3 from 0 to 1, i.e. {0,a,1}.
If you want all vertices at distance 2 through a DFS starting from 0, you
may discover a first (at distance 1) then 1 (at distance 2). You will not
explore 2 (because it would be a distance 3).
When next you will test edge (0,1) and re-discover 1 (this time at
distance 1), you will stop there because '1' has already been discovered.
Thus you will never discover vertex '2'.
If, on the other hand, the algorithm discovered 1 first, then you would
proceed to 2 without any problem.
This is what is wrong.
Nathann
--
Ticket URL: <http://trac.sagemath.org/ticket/19197#comment:20>
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.
