#14732: Realize a poset as a graph
----------------------------------+-----------------------------------------
       Reporter:  chrisjamesberg  |         Owner:  sage-combinat               
     
           Type:  enhancement     |        Status:  closed                      
     
       Priority:  major           |     Milestone:  sage-5.11                   
     
      Component:  combinatorics   |    Resolution:  fixed                       
     
       Keywords:  FindStatDays01  |   Work issues:                              
     
Report Upstream:  N/A             |     Reviewers:  Travis Scrimshaw, Christian 
Stump
        Authors:  Chris Berg      |     Merged in:  sage-5.11.beta2             
     
   Dependencies:                  |      Stopgaps:                              
     
----------------------------------+-----------------------------------------

Comment (by ncohen):

 Yo !

 > Just to say, of course we did it because it is useful for Findstat (you
 can name it, it's not forbidden).

 I thought I named it several time, and I did not want to avoid it. I just
 wanted to make clear that find_stat is a project which is totally distinct
 from Sage, and so we have no reason to change our software for it.

 > But I don't see how it affects anything in anyway for users and how it
 is bad in anyway for Sage. I actually think it it makes it better, because
 I for example would never think of doing  Graph(P.hasse_diagram()) to
 transform the Poset into a Graph.

 ....
 Oh.
 Well, if this is really the problem you want to solve perhaps you could
 have tried to make this work instead :

 {{{
 sage: P = posets.RandomPoset(5,.1)
 sage: Graph(P)
 }}}

 Much more natural, don't you think ?

 > The fact that you know it because you usually work with this object
 doesn't mean everyone knows this.

 That's not my point. "Make a Graph from a poset" means nothing in the
 first place, a poset is not a graph and several graphs would make sense.
 The Hasse Diagram istelf, or its undirected version, or the transitive
 closure, or the undirected version of it.

 What I mean is that you really add a function there "because you want a
 function from Posets to Graphs, whatever it is".

 Besides I just noticed that as I asked during the talk you gave, this
 combinatorial_map thing actually replaces each function it touches by a
 class. And so Sage computes stuff when a users runs code that are ONLY
 USEFUL for you f******** website.

 That's bad work.

 Nathann

-- 
Ticket URL: <http://trac.sagemath.org/sage_trac/ticket/14732#comment:15>
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.


Reply via email to