{"push_id":1182396409,"size":1,"distinct_size":1,"ref":"refs/heads/master","head":"2b088b08058f42dd7c9440e17dd49d4a52d1e530","before":"8f2ed2c85dfae7e53ac517b9960bde044edfe3d2","commits":[{"sha":"2b088b08058f42dd7c9440e17dd49d4a52d1e530","author":{"name":"Shao Sun","email":"fac709b3f3bfe822f953b0e2b87513b2db4f3f85@virginia.edu"},"message":"Update for the night of Jun. 29\n\n// TODO starts coding from here\n// TODO buy ticket routes first\n// TODO write another find shortest path method to deal with claimed\nroutes\n// TODO check possibility and affordability of each owned ticket\n// TODO See if it is ok to\nreturn a random route if two routes exist between two cities\n\nSummary:\n1) Wrote a separate method for sort ArrayList<Routes> in descending\norder by their costs.\n2) Created getNeighbors(Destination city) to return all the neighbors\nof a given city.\n3) Created shortestPath(Destination from, Destination to) to return a\nstack of the shortest path between two cities.\n4) Created printRoute(HashMap<Destination, Destination> parent,\nDestination child, Stack<Route> rt) to recursively push routes of the\nchild and parent city to the stack\n5) Created getOneWayRoute(Destination from, Destination to) to return\nthe route objects between the given cities if it exists (returns null\nif not exist)","distinct":true,"url":"https://api.github.com/repos/ss2cp/AI_HW3/commits/2b088b08058f42dd7c9440e17dd49d4a52d1e530"}]}
{"actor":{"display_login":"ss2cp"}}