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]
Also, can it give a minimum chain partition, such as with the Combinatorica command: MinimumChainPartition[g] 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.
