#15550: Implement the Kirchhoff-Symanzik polynomial for graphs
-------------------------------------+-------------------------------------
Reporter: chapoton | Owner:
Type: enhancement | Status: needs_work
Priority: minor | Milestone: sage-6.1
Component: graph theory | Resolution:
Keywords: symanzik | Merged in:
polynomial | Reviewers:
Authors: Frédéric Chapoton | Work issues:
Report Upstream: N/A | Commit:
Branch: u/chapoton/15550 | 7eefb7f5d7703df4fee1d026ec742626e72134bf
Dependencies: | Stopgaps:
-------------------------------------+-------------------------------------
Changes (by chapoton):
* status: needs_review => needs_work
Comment:
Hello
Thank you Nathann for spending time on this, and sorry for not answering
well-enough.
I have now added a 'output' keyword to 'cycle_basis', 'is_tree' and
'is_forest'.
Still I am not satisfied, because when output is set to 'edge', the cycle
is not returned as a list of triples (vertex,vertex,label), but as a list
of pairs [vertex,vertex]. It cannot therefore be recognized as an edge,
i.e does not belongs to G.edges().
I will try later to correct that.
--
Ticket URL: <http://trac.sagemath.org/ticket/15550#comment:27>
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/groups/opt_out.
