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 ...

This project is an implementation of several fundamental graph traversal and pathfinding algorithms in Java. It was completed as part of the CS 314: Data Structures course at The University of Texas ...

In algorithms, as in life, negativity can be a drag. Consider the problem of finding the shortest path between two points on a graph — a network of nodes connected by links, or edges. Often, these ...

Hey! I noticed that the repo doesn’t yet have Dijkstra’s Algorithm, which is super useful for finding the shortest path in weighted graphs. I’d love to add it. Here’s what I plan to do: Implement ...

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 ...