{"push_id":1650202058,"size":1,"distinct_size":1,"ref":"refs/heads/master","head":"6087885fe10b38836b013c5c6a7ea3851762ba9f","before":"dd18bd4393f03392d10b662b4a7b01383997a61d","commits":[{"sha":"6087885fe10b38836b013c5c6a7ea3851762ba9f","author":{"name":"Bruno","email":"e0270d947f83d7899165880a6ad1163d9832c6ea@yahoo.com.br"},"message":"Estrutura do Grafo e Algoritmo Dijkstra quase pronto","distinct":true,"url":"https://api.github.com/repos/Teodim/K-Shortest-Path-using-Dijkstra/commits/6087885fe10b38836b013c5c6a7ea3851762ba9f"}]}
{"actor":{"display_login":"Teodim"}}