# HG changeset patch
# User Nathann Cohen <nathann.cohen@gmail.com>
# Date 1330763922 3600
# Node ID b253ff9dd6679fbe378cda98f2cfad7f2a8feff0
# Parent 218094b2e56274dae1c8cf21bb191d2cc5ab7b44
Removing two files from sage/graph/graph_decomposition/rankwidth
diff git a/sage/graphs/graph_decompositions/rankwidth/README b/sage/graphs/graph_decompositions/rankwidth/README
deleted file mode 100644
+




1   This program calculates rankwidth and rankdecompositions. It is based on ideas from "Computing rankwidth exactly" by Sangil 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. 
2   On today's computers it works quite well up to graph sizes of about 28 nodes. 
3   
4   Assuming that libigraph is installed it can be compiled using e.g. "gcc O2 std=c99 pedantic rw.c simplerw.c ligraph". 
5   
6   It supports a number of input graph formats; there is an example graph included, for which rankwidth and rankdecomposition can be calculated using "./a.out edgelist igrid". 
7   
8   rw.h / rw.c provide a general mechanism for calculating rankwidth and rankdecompositions. simplerw.c provides a simple commandline interface. 
9   
diff git a/sage/graphs/graph_decompositions/rankwidth/__init__.py b/sage/graphs/graph_decompositions/rankwidth/__init__.py
deleted file mode 100644
+




1   # This file is not empty ! 