Small Function Code in Python for implementing Djikstra Algorithm (Shortest Path Algorithm). Can be integrated in big code as a function

A script to create the fatest way to invad-run Paris !

Predicting the best route for the delivery of Starbucks in London.

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 .

Easy & Efficient Path Finding Library in Python

Social Network Analysis (SNA) project analyzing interactions between students and professors in a class. By using Dijkstra's Algorithm, it uncovers key nodes and explores collaborative dynamics. The project aims to reveal patterns of interaction that contribute to the social structure and enhance the overall academic experience.

Path Finder is a Java application designed to compute the shortest path between buildings using Dijkstra's algorithm. It features a command-line interface that allows users to load graph data from files, view dataset statistics, and calculate shortest paths between specified locations.

📗 Repositório para arquivos da disciplina GSI011 - Estrutura de Dados 2

My final project for CS 2110: Object-Oriented Programming and Data Structures(Java)

All the Assignments saved from Cornell University CS 2110(Object-Oriented Programming and Data Structures course)

Implementations of various path finding algorithms in a maze environment and visualization using pygame.

👋Welcome to Pathfinding Visualizer! I built this application because I was fascinated by pathfinding algorithms, and I wanted to visualize them in action. I hope that you enjoy playing around with this visualization tool just as much as I enjoyed building it.

Here you can find design/simulations of different aspects of computer structures.

🚄 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. 🚇📍

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

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

This project is an implementation of the A* algorithm by extending an existing codebase that already includes the Dijkstra's algorithm. The A* algorithm incorporates additional functionalities by calculating heuristic values and updating cost calculations to allow for more efficient pathfinding and improved search performance.

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

Route Optimization using Djikstra's Algorithm