A collection of sorting algorithms and data structures implemented in C++. Each algorithm and data structure comes with its own set of test cases to ensure correctness and robustness.

Speculate and Correct Algorithm - An optimized Bellman-Ford-like algorithm

Brewing GAPBS with vertex reordering and graph segmentation

CS-2023-Data-Structures-Algorithms

OpenGraph is an open-source graph processing benchmarking suite written in pure C/OpenMP.

site

Quick Multi-Robot Motion Planning by Combining Sampling and Search (IJCAI-23)

Parallel implementation of Dijkstra's algorithm

SSSP stands for Single-Source Shortest Path. This Dijkstra algorithm is used to obtain optimal solution for SSSP problem.

This repository contains my implementations of algorithms that solve the SSSP problem in a Graph

OpenMP implementation of Graph500 suite.

Graph Processing Framework that supports || OpenMP || CAPI

Compute metrics for modeled gossip networks

Parallel Delta-Stepping SSSP algorithm with the bucket fusion technique invented by Zhang et al. (CGO 2020). Implemented in C++, using the openMP parallelization API.

Golang SSSP library

A java implementation that introduces a way to find single source shortest paths from a given node to other nodes in the graph. The program works for both directed acyclic graphs(DAGs) as well as for directed graphs that include cycles. The input is given via a pre-validated text file written by the user, which contains the number of vertexes, n…

My Solutions to problems in [Competitive Programming 3]

CLI for nvGraph, which is a GPU-based graph analytics library written by NVIDIA, using CUDA.