Hi, Two easy reviews. These are required to update to sagemath-6.8. [I will work to update to sagemath-6.9...]
https://bugzilla.redhat.com/show_bug.cgi?id=1278081 rw - Program that calculates rank-width and rank-decompositions rw is a program that calculates rank-width and rank-decompositions. It is based on ideas from "Computing rank-width exactly" by Sang-il Oum, "Sopra una formula numerica" by Ernesto Pascal, "Generation of a Vector from the Lexicographical Index" by B.P. Buckles and M. Lybanon and "Fast additions on masked integers" by Michael D. Adams and David S. Wise. https://bugzilla.redhat.com/show_bug.cgi?id=1278140 planarity - Implementations of several planarity-related graph algorithms This code project provides a library for implementing graph algorithms as well as implementations of several planarity-related graph algorithms. The origin of this project is the reference implementation for the Edge Addition Planarity Algorithm, which is now the fastest and simplest linear-time method for planar graph embedding and planarity obstruction isolation (i.e. Kuratowski subgraph isolation). Thanks, Paulo -- devel mailing list devel@lists.fedoraproject.org https://admin.fedoraproject.org/mailman/listinfo/devel Fedora Code of Conduct: http://fedoraproject.org/code-of-conduct