I've written some important Algorithms and Data Structures in an efficient way in Java with references to time and space complexity. These Pre-cooked and well-tested codes help to implement larger hackathon problems in lesser time. DFS, BFS, LCA, LCS, Segment Tree, Sparce Table, All Pair Shortest Path, Binary Search, Matching and many more ...

Pathfinding library for calculating all node pairs' shortest paths in an unweighted undirected graph.

Python solutions for Tim Roughgarden's 4 part books called Algorithms Illuminated

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

Source code of the paper "An efficient implementation for solving the all pairs minimax path problem in an undirected dense graph."

NTHU CS5422 Parallel Programming Course Projects (include Odd-Even Sort, Mandelbrot Set, All-Pairs Shortest Path, Blocked All-Pairs Shortest Path)

My solutions to Google's Foobar Challenge for coding data structures and algorithms. Includes my solution code, unit tests, background notes, design notes, and references.

Cuda Shortest Paths - Parallel Dijkstra and Floyd algorithms using Nvidia CUDA to calculate All-Pairs Shortest Path (APSP) in a given graph represented by its adjacency matrix.

Optimized implementation of Floyd Warshall algorithm using modern AVX2.

CPP codes for some popular algorithms

This repo is to solve the all-pairs shortest path problem with CPU threads and then further accelerate the program with CUDA accompanied by Blocked Floyd-Warshall algorithm

Source code of the paper "Solving the all pairs shortest path problem after minor update of a large dense graph."

Advanced Algorithms Problems | Engineering

Different operation of Directed Graph or Undirected Graph using C++

http://journals.plos.org/plosone/article?id=10.1371/journal.pone.0185333

No description provided.

Data Structures: Arrays, Stacks, Queues, Graphs applications in image processing, tag parsing and routes/maps respectively.

A parallel algorithm for all-pairs shortest paths that minimises data movement. Final year project at the University of Cambridge.

Useful data structures and algorithms mostly related to Graphs.

No description provided.

No description provided.

Parallel implementation for the Blocked Floyd Warshall APSP algorithm. Designed and implemented in C++ for CUDA GPUs

Implementations of some common data structures and algorithms. These are based on the assignments that are offered in CSE208 course by BUET.

parallel Stencil2D and ASP (AP assignment)

Graph Algorithms Project

Assignments from Algorithms Course like - All pairs shortest path, Common Substrings, Huffman Coding, K-nary Heaps, KMP, Line Sweep, Matrix Chain Multiplication, Maximum Flow, Quick Sort, Strongly Connected Components

Floyd–Warshall all-pairs shortest paths with optional O(n^2) incremental relaxation. / ワーシャル・フロイド法（全点対最短経路）。辺追加時の距離行列更新をO(n^2)で実行可能。

Floyd-Warshall all pairs shortest path algorithm