A general-purpose lightweight C++ graph library

Dijkstra and Bellman-Ford shortest path algorithms

This project implements a simple client-server application in C++ that calculates the shortest path between two vertices in a graph using the Breadth-First Search (BFS) algorithm.

I've created files with solutions, named them with their following conventions and order. You can download, copy, and run them on a compiler or software for your information. There are no copyrights attached to these files; they are provided for educational purposes only.

GAL-DAWN: An Novel Graph Algorithm Library based on DAWN, CUDA/C++

A payment simulator in the Lightning Network implementing different fee adjustment strategies

GAL-DAWN: An Novel High performance computing Library of Graph Algorithms based on DAWN, CUDA/C++

This repository contains all home and lab assignments for the CSE 208: Data Structures and Algorithms II Sessional course, part of our Term-2, Level-2 curriculum. It applies theories from CSE 207 to problem-solving and creating data structures.

Graph datastructure & shortest path algorithms writen in C++

Algorithms and Operations on Graphs.

Simple implementation of Dikjstra's algorithm in C++

A repository for uploading exercises from the FMI SDA (Data Structures and Algorithms) Course 2023-2024.

A C++ implementation of a weighted graph using an adjacency matrix. 📊 Features include vertex and edge management, shortest distance calculation with Dijkstra's algorithm 🛤️, and adjacency matrix visualization. 📈 Robust error handling included. 🚨 Install by including weighted_graph.h and using the provided skeleton files for testing. 📝

This is a project to calculate the price of a metro ticket using (Graph Theory, BFS and Shortest Path).

Maze generation, solving & finding shortest paths algorithms with backtracking, written in C++ and SFML.

My studies about algorithms C/C++

Grafos, Dynamic Programming, Greedies, Max Flow, Shortest Path. Proyectos en C++ de la materia Algoritmos y Estructuras de Datos III. FCEN UBA 2° Cuatrimestre 2023.

Shortest path algorithms for directed graphs with/without cycles, optimized for minimal costs and bounded edge values.

Algorithms implemented in C++