{"push_id":1258862516,"size":1,"distinct_size":1,"ref":"refs/heads/master","head":"3093d8869d347b5675fbec65136e7a77c423f9e0","before":"cf006efc6b7ba1f472112424c7bbe909ea6cf33e","commits":[{"sha":"3093d8869d347b5675fbec65136e7a77c423f9e0","author":{"name":"Fauxtographer","email":"9ec94b5a2f942c3435ca4bac6cde633d8d7970b7@student.rmit.edu.au"},"message":"Rewrote shortest path algorithm to a breadth first search algorithm. works waaaaaaaaaaaaaaaaaaaaaay better than the last algorthm (which also worked, just exponentially :P)\nWill keep previous code in comments until i have written my section on arrayList. will delete afterwards.","distinct":true,"url":"https://api.github.com/repos/carkus/AA_Assignment1/commits/3093d8869d347b5675fbec65136e7a77c423f9e0"}]}
{"actor":{"display_login":"rmit-s3502921-gabriel-haines"}}