Finding-Least-Time-Path-Project

This project implements Dijkstra's algorithm to find minimum time needed to reach destination from source using buses and plane given a condition that one can travel through plane atmost once through a web application .