You signed in with another tab or window. Reload to refresh your session.You signed out in another tab or window. Reload to refresh your session.You switched accounts on another tab or window. Reload to refresh your session.Dismiss alert
A C++ implementation of a weighted graph using an adjacency matrix. 📊 Features include vertex and edge management, shortest distance calculation with Dijkstra's algorithm 🛤️, and adjacency matrix visualization. 📈 Robust error handling included. 🚨 Install by including weighted_graph.h and using the provided skeleton files for testing. 📝
This project aims to take the shortest route to all selected cities and return to the starting city. It uses the dijikstra algorithm while calculating the shortest path.
This flight management system aims to provide the user the information about the fare and distance between two airports, among the 10 airports which are already present in the system. A user can also delete or add a new airport in the system.