This project finds the shortest path from one word to another, by modifying one letter at a time (changing into valid word at each step). A corpus of five-letter words is converted into an adjacency ...

A graph-based application that determines the shortest flight route between two cities using Dijkstra's algorithm. The graph is represented as an adjacency matrix. Given a list of directed flight ...