#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:
u/jmantysalo/document_how_to_choose_algorithm_in_some_graph_functions|
f89291574aa5366124358688579110bf5601d265
Dependencies: | Stopgaps:
-------------------------------------+-------------------------------------
Changes (by jmantysalo):
* commit: => f89291574aa5366124358688579110bf5601d265
Comment:
OK, I did a suggestion of documenting this. Now the last question for
this: Is it really so that for one algorithm "no negative weight is
allowed" and another "works only with positive weights", i.e. they have
difference with zeros?
And then to `triangles_count()`... This will take some time.
----
New commits:
||[http://git.sagemath.org/sage.git/commit/?id=f89291574aa5366124358688579110bf5601d265
f892915]||{{{Documentation of wiener_index() changed.}}}||
--
Ticket URL: <http://trac.sagemath.org/ticket/19599#comment:7>
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.
