X-Git-Url: https://www.ginac.de/ginac.git//ginac.git?p=ginac.git;a=blobdiff_plain;f=check%2Ftime_lw_P.cpp;h=2f7569f0cb52a007944940f10a342309d38fd6b0;hp=3145093ae2a016eea9405ccd705c58152fc12ca4;hb=e29584838dc377a2c2b00731a0ffdbdc3425f214;hpb=70ff026226b1a1a7530e8a1d934b98ad42795a1d diff --git a/check/time_lw_P.cpp b/check/time_lw_P.cpp index 3145093a..2f7569f0 100644 --- a/check/time_lw_P.cpp +++ b/check/time_lw_P.cpp @@ -22,18 +22,26 @@ */ #include "times.h" -#include "time_lw_w101n.h" static unsigned test(void) { - matrix m(101,101); - for (unsigned r=0; r<101; ++r) { - for (unsigned c=0; c<10; ++c) { - m.set(r, - unsigned(ex_to_numeric(w101_numeric[r][2*c+1]).to_int()-1), - w101_numeric[r][2*c+2]); - } - } + // This is a pattern that comes up in graph theory: + const unsigned n = 10; + matrix m(n*n+1,n*n+1); + for (unsigned i=1; i<=n*n; ++i) + m.set(i-1,i-1,1); + for (unsigned i=1; i<=n*n; ++i) + if (!(i%n)) + m.set(i-1,n*n,1); + for (unsigned i=1; i<=n*n; ++i) + if (!((i-1)%n)) + m.set(n*n,i-1,n-(i-1)/n); + for(unsigned i=1; i<=n; ++i) + for (unsigned j=1; j<=n; ++j) + if (i-j) + for (unsigned k=1; k