grafi e dintorni
non provate a creare (in python e con primitive standard, mentre con le ctypes potrebbe funzionare) una matrice di adiacenza per un grafico di 250mila nodi… e’ un filino troppo grossa… …ovviamente ho dovuto killare il processo. Ok che OsX e’ figo, ma vi sareste fidati a continuare a lasciar swappare un processo da 10Gb [...]
graphs
“bipartite graphs” (or graphs in general, and oo-implementations), any suggestion of good books to buy? + + + update Last login: Wed Dec 23 16:58:14 on ttys002 grinder:~ zeph$ sudo port install boost and recovered the book from “Informatica 3″ … : “A practical introduction to data structures and algorithm analysis, JAVA EDITION“, Clifford A. [...]
sconforto
related to: “extreme compression” grinder:msm.git zeph$ ./gmsm 90575_exp90575.txt 90000_exp90000.txt reading… 90575_exp90575.txt a: converting to int() reading… 90000_exp90000.txt searching the bigger suitable divisor selected the 1^th number of the serie b_size: 445883 …dividing c_size:3100, r_size:445881 …writing results done. -rw-r–r– 1 zeph staff 448983 Apr 12 18:33 90575_exp90575.txt -rw-r–r– 1 zeph staff 448985 Apr 13 19:12 90575_exp90575.txt.msm [...]