{"push_id":1522274150,"size":1,"distinct_size":1,"ref":"refs/heads/Incorporate-network-flow-problem","head":"7f22f3d92969c4ed95b2795601e3f4dcf84089d1","before":"cdb20a96e53920c59ac42272d441324ec319cf9e","commits":[{"sha":"7f22f3d92969c4ed95b2795601e3f4dcf84089d1","author":{"name":"Andrew Blohm","email":"48fe3138771ae35bc58af1f072411c8e7a5ca72b@umd.edu"},"message":"Update GEP.gms\n\nImproved code comments and added a new set, which is a subset of all nodes that does not include the reference node (for purposes of the ptdf constraints).","distinct":true,"url":"https://api.github.com/repos/andymd26/vigilant-enigma/commits/7f22f3d92969c4ed95b2795601e3f4dcf84089d1"}]}
{"actor":{"display_login":"andymd26"}}