Hey there, I'm sooooo tired right now. If you remember last week, I mentioned that I finished my comp 282 program a week early. Well, to my dismay I found out on Monday that even though my program found the shortest path, it didn't implement A* using Dijkstra's algorithm. It was, instead, implementing A* with a Breadth First Search, however I
(
Read more... )