I was given the project of web development. I would create simulations of various search algorithms such as Dijsktra, A*, and Weighted A*, and in the end, hopefully upload them to my lab's website.
Over the past week, I spent a lot of time reading articles on the inner workings of these algorithms and even more complex extensions of them- algorithms like ARA* and Multi-Heuristic A*. Once understood, these algorithms all seem very intuitive in nature and follow a clear logical process (like Djisktra is just repetitively adding the closest neighboring node to a final set of nodes and then updating the neighboring nodes' distance values), but writing them in code isn't simple for me. I've also been using data structures that I haven't touched before, such as priority queues.
I tried my hand at implementing A* and Djisktra in Java, and will soon convert my code into Javascript so that it can work as part of a Javascript applet and be used on the web.
Over the past week, I spent a lot of time reading articles on the inner workings of these algorithms and even more complex extensions of them- algorithms like ARA* and Multi-Heuristic A*. Once understood, these algorithms all seem very intuitive in nature and follow a clear logical process (like Djisktra is just repetitively adding the closest neighboring node to a final set of nodes and then updating the neighboring nodes' distance values), but writing them in code isn't simple for me. I've also been using data structures that I haven't touched before, such as priority queues.
I tried my hand at implementing A* and Djisktra in Java, and will soon convert my code into Javascript so that it can work as part of a Javascript applet and be used on the web.
Comments
Post a Comment