In this project, we will use the algorithm we learned in the Graph Theory course: Dijkstra's Algorithm. The main purpose of the algorithm is to find the shortest path on Graf.

Maze Solver using graph theory made by C++

The algorithms were written as part of the Algorithms and Data Structures class at UMCS.

Graph algorithms and backtracking algorithm

Implementation of two graph representations and few algorithms with comparison of how fast they perform.

This repo is created as a part of Data Structure and Algorithms course at my college.

Data Structures and Algorithms labs

This repository contains the code for the lab session of the course Graph Theory.

✈️ Shortest Path Algorithms: DFS, BFS, Dijkstra, Bellman-Ford, Floyd

Implementation of graph algorithms

This project, written in C++, uses Dijkstra's algorithm for shortest path finding and priority scheduling for road construction, combined with the Banker's algorithm to manage resources, ensuring efficient and safe road construction planning and execution.

Study of graph algorithms perfomance. Was conducted for Prims and Kruskal algorithms for building MST, Dijkstra and Bellman-Ford - for shortest path

This is a school project which aims to compare the performance of different versions of Dijkstra's algorithm.

C++ EV charging network simulation using weighted graphs and Dijkstra’s algorithm.

Algorithmia: Backtracking, Prefix Sums problems, Multiple Knapsack problem (Dinamyc programing). Adapted BFS, Kruskal, Dijkstra implementations. Heuristics, Greedy algorithms, k-opt search.

Dijkstra's algorithm to find shortest path distance using random graph generator on 4D array.

Projects for Data Structures & Algorithms classes.