{"push_id":963823454,"size":1,"distinct_size":1,"ref":"refs/heads/master","head":"8b7755da5d901746a0b5b391fd46be2c392e426a","before":"c3c7995033797d595c3316637865907ed6fedb77","commits":[{"sha":"8b7755da5d901746a0b5b391fd46be2c392e426a","author":{"email":"ac4af2e4089792524123c85608a167e5125aac00@gmail.com","name":"Lorenzo Affetti"},"message":"[fix/bf_complexity] Now BF shows linear complexity.\nStill remains that, with p = 1 (strongly connected graph),\nwe should get O(n^2)...\n\nPartially\nFixes #2","distinct":true,"url":"https://api.github.com/repos/affo/sand/commits/8b7755da5d901746a0b5b391fd46be2c392e426a"}]}