#18366: Bug in tutte_polynomial with labeled graphs
-----------------------------+-------------------------------
Reporter: mhansen | Owner:
Type: PLEASE CHANGE | Status: new
Priority: major | Milestone: sage-6.7
Component: combinatorics | Keywords:
Merged in: | Authors: Mike Hansen
Reviewers: | Report Upstream: N/A
Work issues: | Branch:
Commit: | Dependencies:
Stopgaps: |
-----------------------------+-------------------------------
See https://groups.google.com/forum/#!topic/sage-combinat-
devel/phOAtoZxl74
{{{
G = Graph();
G.allow_multiple_edges(True);
#edges are (u,v,l), where (u,v) is the edge and l is the label, which
determines edge order
G.add_edges([(0,1,1),(1,5,2),(5,3,3),(5,2,4),(2,4,5),(0,2,6),(0,3,7),(0,4,8),(0,5,9)]);
g = G.tutte_polynomial();
print g(1,1);
print G.spanning_trees_count();
produces
T(1,1): 60
Number of spanning trees: 52
}}}
--
Ticket URL: <http://trac.sagemath.org/ticket/18366>
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.
