Library for functional graph & geometry algorithms

Learning graph data structure.

Proiectarea Algoritmilor - UPB 2019

System that finds the critical path of the graph of the disciplines of the Computer Science course at UnB (University of Brasília).

java program used to sort a set of partially-ordered elements.

Topological sort (Kahn algorithm) an oriented graph containing any kind of node, using ES6 Maps & Sets.

By Mayank Raghuvanshi

non-preemptive job shop scheduling with atomic jobs

Topological Sort Problems

Deals with the Algorithms along with the explanation.

Kahn's algorithm (topological sort)

Pathfinding Visualizer - Web App to demonstrate how pathfinding algorithms works.

Computes a numbering of a DAG (directed-acyclic-graph) where each vertex has a unique number and they are ordered

This Comprehensive ETL project is designed for efficient data migration and replication between oracles databases with change data capture (CDC), this project enables near real-time data sync while maintaining data integrity and relationship consistency.

A FastAPI-based backend that validates whether a directed graph is a Directed Acyclic Graph (DAG) using Kahn’s Algorithm. It integrates with the Flowcraft frontend to analyze graph pipelines.

A Python tool to implement, compare, and analyze the practical performance of DFS-based and Kahn's (source-removal) topological sort algorithms.

Java logic simulator with topological evaluation, Graphviz visuals, composite adders, and linear-time benchmarks.

Graph algorithms studied in the Graph Theory and Application class at Universidade de Brasília (UnB) in the first semester of 2021.

Kahns Visualiser

Implementation of the parallel version of the Kahn algorithm (Topological Order).