{"push_id":655703194,"size":1,"distinct_size":1,"ref":"refs/heads/master","head":"93165218a09aa5673cbeeb9db39bee20749df11b","before":"9a769e17784028d8ea01ab3ec1cac391e0fb9619","commits":[{"sha":"93165218a09aa5673cbeeb9db39bee20749df11b","author":{"email":"d09f5720e5570d60b2bffd9d1a40baba1e33bb0e@gmail.com","name":"Benoît"},"message":"S.Path in terms of # of edges + keep track of minimum capacity along the S.Path","distinct":true,"url":"https://api.github.com/repos/benoitdancoisne/SparkMaxFlow/commits/93165218a09aa5673cbeeb9db39bee20749df11b"}]}