Dijkstra's Shortest Path for 6, 18, and 26-Connected 3D (Volumetric) Image Volumes

Programming assignments of NPTEL DAA course taken by Prof. Madhavan Mukund of Chennai Mathematical Institute.

Selected Graph Algorithms

This is CPP code for real time use case of Dijkstras algorithm to find the shortest path from source to every destination

🚄 an application meant for linux users, It helps you find & visualize the Shortest Path between Delhi Metro Stations, it uses Graph Data Structure & Dijkstra's Algorithm.

A C++ implementation of famous graph-based algorithms.

This repository contains graph based algorithms for motion planning/decision-making in Robotics context.

CPP codes for some popular algorithms

DSA Semester Project : It is developed using Linked-List , Stack , Queue , Priority Queue , AVL Tree with lexicographical Comparison , Graph , Dijkstra Algorithm and Arrays.

An efficient C++ representation of an edge-based (un)directed graph {V,E} with search and other graph theory algorithms, plus a basic implementation of Teresco's METAL highway pathfinding project.

TRACE: Topological Graph Representation for Automatic Sulcal Curve Extraction

The A* & Dijkstra search algorithm visualization using C++ & OpenGL

Various Pathplanning Algorithms Derived off Dijkstra's in mulitple situations visualized by SFML. Paper: https://schmider.kim/vwa/main.pdf

Finding the shortest path in a grey-scale elevation map. Converts all pixels in the image to Nodes with elevation data gathered from analysis of the unsigned char value at any given pixel. Then utilizes Dijkstra's algorithm for a greedy search with a priority queue, organized with a node comparison binary functor, to first find the shortest path…

An Arduino application that finds the shortest driving route using Dijkstra's Algorithm

Pac man game in C++ - an old high school project

A simple program that implements Dijkistra's algorithm graphically using SDL. A work in progress.

Geodesic Distance Calculator with Dijkstra Algorithm

Dijkstra path finding algorithm implemented using MPI

Dijkstra's, Prim's and Eulerian tour to determine best airline route written in C++