#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: | Work issues:
Report Upstream: N/A | Commit:
Branch: u/chapoton/15550 | 87702b4df58f7226297886d9fc505e8bec4e5cdc
Dependencies: | Stopgaps:
-------------------------------------+-------------------------------------
Comment (by ncohen):
> thanks for the suggestion. But `is_forest` does not work correctly on
graphs with multiple edges:
Oh. Well, multiple edges actually make no difference, unless you have a
2-cycle. In which case that is your certificate. I think that fixing that
is still better than re-implementing it with a weird name.
> and moreover I need the cycle as a sequence of signed edges.
What does that mean ? Can't that be obtained with the certificate of
`is_forest` ?
Nathann
--
Ticket URL: <http://trac.sagemath.org/ticket/15550#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/groups/opt_out.
