On Wed, Nov 9, 2011 at 5:52 PM, Raymond N. Greenwell <mat...@gmail.com> wrote: > I've been having some problems with Combinatorica, and someone > suggested I try Sage. Can Sage import a csv file and then turn it into > a graph, such as with the Combinatorica commands: > m = Import["medalcomparison3.csv"] > g = FromAdjacencyMatrix[m, Type -> Directed]
Python (hence Sage) can import csv files as explained here: http://docs.python.org/library/csv.html Sage can make a graph out of an adjacency matrix A using the Graph(A) command. Type "Graph?" for more on making graphs from matrices etc. In Sage you can make matrices in many ways. Type "matrix?" for more on how. > Also, can it give a minimum chain partition, such as with the > Combinatorica command: > MinimumChainPartition[g] As far as I can tell, this is not implemented in Sage. > I have found that this Combinatorica command does not always give what > one would expect; the results seem to violate the Dilworth Theorem. > > Thanks! > > -- > You received this message because you are subscribed to the Google Groups > "sage-combinat-devel" group. > To post to this group, send email to sage-combinat-devel@googlegroups.com. > To unsubscribe from this group, send email to > sage-combinat-devel+unsubscr...@googlegroups.com. > For more options, visit this group at > http://groups.google.com/group/sage-combinat-devel?hl=en. > > -- William Stein Professor of Mathematics University of Washington http://wstein.org -- You received this message because you are subscribed to the Google Groups "sage-combinat-devel" group. To post to this group, send email to sage-combinat-devel@googlegroups.com. To unsubscribe from this group, send email to sage-combinat-devel+unsubscr...@googlegroups.com. For more options, visit this group at http://groups.google.com/group/sage-combinat-devel?hl=en.
