🚄 Explore Mumbai's Railway Wonders! 🌆 Discover the shortest routes with Djikstra’s algorithm, connecting all railway lines seamlessly. 🗺️ Dive into our interactive map, highlighting tourist spots near major stations. 🏰🌐 Get ready for an exciting journey with a comprehensive list of stations and a detailed railway map. 🚇📍

This project is a map analyzer that finds the fastest route between two points using Dijkstra's algorithm and analyzes the map's road network. It can also generate a barely connected map using a minimum spanning tree approach.

Strategy Algorithm Projects is projects to completed the course of Strategy Algorithm in fourth semester. This projects must be implemented some algorithm, in this projects, we implemented Greedy Algorithm(Djikstra) and comparing with Brute-force. At the end, we must analyze the complexity both algorithm

My assignments, labs, and code snippets from INF135 (Advanced Programming) at UiB (University of Bergen)

University Project. Main Topics : Recursion, Graphs, BackTracking, Greedy, Djikstra, Kruskal

Projet de Détermination de Satisfaisabilité SAT via Graphes et Composantes Fortement Connexes

Este projeto tem como objetivo encontrar o caminho mais rápido ao se locomover utilizando metrôs e trens em São Paulo. Para isso, realizei a construção de um grafo e utilizei o algoritmo de Dijkstra para encontrar as rotas mais rápidas de um local ao outro.

Codes implemented based on the book "GrokkingAlgorithms"

Rapid Route is a cab booking system web application designed to provide efficient and convenient transportation services. It allows users to book cabs, view available routes, and manage bookings seamlessly.

Practical applications of pathfinding algorithms.

Deep Learning based web application to automate tree enumeration in forest areas using satellite imagery.

Marauder Map is an interactive map application inspired by the magical map from the Harry Potter series. Our application is designed to provide users with real-time traffic data and efficient route planning using A* and Dijkstra algorithms.

Revolutionize Mumbai's bus service with SVR-based population density prediction and NetworkX route optimization. Dynamic map visualization ensures efficient coverage of high-density areas, enhancing user-friendly public transportation .

Maze Generator and Solver

Progetto finale per il corso di Algoritmi e Principi dell'Informatica - Politecnico di Milano, a.a. 2020/2021

Shortest path algorithms in a random maze (A* with and without heuristic, Bellman-Ford, Dijkstra)

Exercises of Coding Ninjas Java DSA

📈 Welcome to the Design and Analysis of Algorithms Repository! 📚✨ Immerse yourself in a meticulously curated knowledge pool on algorithmic design and analysis. 🌐💡 Explore the intricacies of crafting efficient algorithms and navigating problem-solving strategies. 🚀🔍 Master the art of algorithmic exploration in this dynamic space! 👨‍💻🧮

LeetCode solved in Python

A Neo4J djiskstra demo, part of EHTP's Java course.