#19599: Document how to choose algorithm in some graph functions
--------------------------------+-----------------------------
Reporter: jmantysalo | Owner:
Type: enhancement | Status: new
Priority: minor | Milestone: sage-wishlist
Component: graph theory | Resolution:
Keywords: | Merged in:
Authors: | Reviewers:
Report Upstream: N/A | Work issues:
Branch: | Commit:
Dependencies: | Stopgaps:
--------------------------------+-----------------------------
Comment (by ncohen):
> Continuing `wiener_index()`. On `'Floyd-Warshall-Python'` reads "but no
negative cycle is allowed". Is the function defined when there are
negative cycles?
No, there is no notion of distance on such graphs.
> Is Boost always available?
{{{
~$ cat /home/ncohen/.Sage/build/pkgs/boost_cropped/type
standard
}}}
> If so, when should the user use `'Floyd-Warshall-Python'` or
`''Dijkstra_NetworkX'`?
I don't know, probably never.
Nathann
--
Ticket URL: <http://trac.sagemath.org/ticket/19599#comment:5>
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.
