#16470: Add optional distance in BFS
-------------------------------------------------+------------------------
Reporter: foosterhof | Owner:
Type: enhancement | Status: new
Priority: minor | Milestone: sage-6.3
Component: graph theory | Resolution:
Keywords: breadth first search distance | Merged in:
Authors: | Reviewers:
Report Upstream: N/A | Work issues:
Branch: | Commit:
Dependencies: | Stopgaps:
-------------------------------------------------+------------------------
Comment (by ncohen):
I do not understand your problem, but do you know
`g.distance(by_weight=True)` ? A BFS with a distance on the edges is
called "Dijkstra's algorithm", and it is implemented in Sage.
Nathann
--
Ticket URL: <http://trac.sagemath.org/ticket/16470#comment:1>
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.
