Back in the hazy olden days of the pre-2000s, navigating between two locations generally required someone to whip out a paper map and painstakingly figure out the most optimal route between those ...

A high-performance implementation of Dijkstra's shortest path algorithm comparing sequential and parallel approaches using Intel TBB (Threading Building Blocks). Dijkstra/ ├── main.cpp # Main program ...

This project combines artificial intelligence search algorithms and machine learning for intelligent traffic navigation. It features an interactive GUI application that visualizes Melbourne traffic ...

If you’ve been making the same commute for a long time, you’ve probably settled on what seems like the best route. But “best” is a slippery concept. Perhaps one day there’s an accident or road closure ...

If you want to solve a tricky problem, it often helps to get organized. You might, for example, break the problem into pieces and tackle the easiest pieces first. But this kind of sorting has a cost.

Abstract: This full research paper explores undergraduate students' misconceptions of Dijkstra's algorithm quantitatively. Graph algorithm misconceptions have been studied to a modest extent, but they ...