{"push_id":666343988,"size":1,"distinct_size":1,"ref":"refs/heads/master","head":"79e248e9b1d824b95b7c000589ac9163861fcada","before":"1aedb9fad7a8ecd4a9254595ac7a0e3bf27342be","commits":[{"sha":"79e248e9b1d824b95b7c000589ac9163861fcada","author":{"email":"23a944d130f0ce0a600ae9024159579cbcd422d6@gmail.com","name":"Alexander Niema Moshiri"},"message":"Fixed Eulerian Path Problem\n\nOriginally needed a sink node and a source node. Fixed it so that it\nlooks for a \"start\" and \"end\" node instead, where \"start\" has 1 less\nincoming edge than outgoing, and \"end\" has 1 more incoming edge than\noutgoing.","distinct":true,"url":"https://api.github.com/repos/niemasd/Algorithm-Problem-Solutions/commits/79e248e9b1d824b95b7c000589ac9163861fcada"}]}