MazeBlaze is a maze-solving bot which find the shortest path in the given maze.

In this project, ı implement the Dijkstra algorithm with adjacency list representation to make a program that finds the cheapest flights between given destinations on the network.

Shortest path finder using Dijkstra's algorithm for graph traversal.

Maze is a C library that is capable of scanning a complex maze and find the shortest path to end using Dijkstras algorithm. It can function independently as well as on any simulator or hardware. The same has been used to simulate a line follower robot on Coppeliasim ( VREP ) using its legacy remote API in C.

A basic C-based Dijkstra's algorithm application for finding shortest paths in city networks. Features user-specified input and min-heap for efficiency.

A high-performance communication-avoiding implemetation of the parallel 2D Floyd-Warshall algorithm for the all source shortest path problem

IMPLEMENTATION OF SHORTEST PATH FINDING ALGORITHMS IN C

In this project, given a matrix of integers where each cell represents a weight, you are tasked with writing a program that finds a continuous path that combines any element of the first row with any element of the last row in the matrix, aiming to minimize the sum of items along the path.

Implementation of a short path finder using Q learning in C language

General Problems in C

Finding shortest path from source node to all nodes using dijkstra's in linearithmic time

Floyd-Warshall shortest path algorithm implementations in C.

A 2D adventure game built with MiniLibX. Players collect items on the map and reach the exit using the W, A, S, and D keys. The map includes walls, collectibles, and free spaces. The goal is to collect all items and find the shortest path to escape.

Program to find the shortest distance between any two major stations (using Dijkstra's algorithm) of the South Western Railway Network (India).

Advanced Algorithms in DSA

Simple project in C to practice using arrays and loops as an assignment in Systems Programming A @ Ariel University

Research work for shortest path algorithms.

C codes for standard algorithms

Floyds Shortest Path using Pthreads