{"push_id":1105244713,"size":1,"distinct_size":1,"ref":"refs/heads/master","head":"9c111abe2dc38191679ef9a37adc9aefb66529a4","before":"080e2bd31d8e40ff4338b02e0ef4c49bd8f970ee","commits":[{"sha":"9c111abe2dc38191679ef9a37adc9aefb66529a4","author":{"email":"6124e8a642e536e8ff5efa6bbc9f17d1e84a19ce@null.net","name":"aalto1"},"message":"fat tree's implementation with all shortest path algorithm among any edge-switch","distinct":true,"url":"https://api.github.com/repos/CriMenghini/cenda/commits/9c111abe2dc38191679ef9a37adc9aefb66529a4"}]}