{"push_id":759478518,"size":1,"distinct_size":1,"ref":"refs/heads/algorithms/pathfinding","head":"b38fa96e7affc6b1556cefd27489e05cda0c264b","before":"ea08681a114739f06701f1353bed03a587071c58","commits":[{"sha":"b38fa96e7affc6b1556cefd27489e05cda0c264b","author":{"email":"8880fa4052a08f7310bf7f1d36b1b72ebb969012@gmail.com","name":"Severyn Kozak"},"message":"Implement A*.\n\nalgorithms/pathfinding/dijkstras_algorithm4.py\n\t-Extend `dijkstras_algorithm()`, making it accept a `heuristic`\n\tfunction parameter that allows the caller to define a custom\n\tnode priority calculation (it makes implementing A* a breeze,\n\tsince it's literally just Dijkstra's with a heuristic function).\n\tAlso add a `diagnostic_reporting` flag, which makes the function\n\tprint out how many nodes it visited.","distinct":true,"url":"https://api.github.com/repos/sevko/portfolio/commits/b38fa96e7affc6b1556cefd27489e05cda0c264b"}]}