kahns-alogrithm

Library for functional graph & geometry algorithms

Proiectarea Algoritmilor - UPB 2019

Learning graph data structure.

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

CEBS (C++ Ergonomic Build System) — A zero-config, blazingly fast, multi-threaded C++23 build system treating modules as first-class citizens. pretty fast too

Nexus is a lightweight, flexible library for building modular, event-driven apps using CQRS. Use built-in command, query, and event buses for simple setups, or extend them for complex architectures. Portable, minimal boilerplate, and adaptable to any ecosystem.

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.

By Mayank Raghuvanshi

non-preemptive job shop scheduling with atomic jobs

Topological Sort Problems

Deals with the Algorithms along with the explanation.

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.

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

Kahn's algorithm (topological sort)

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.

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

Visual service dependency recovery planner built with React and graph algorithms.

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