AlphaSQL provides Integrated Type and Schema Check and Parallelization for SQL file set

A repository for the implementation of various complex algorithms that are graph related and used in the real world applications.

Implement of Distributed cycle detection in large-scale sparse graphs

WhenToTrade cycle analysis BitMEX datafeed integration

Hung-Yi Lee Linear Algebra 2018 Fall Homework

Find strongly connected components of a directed graph using Tarjan's algorithm

By Mayank Raghuvanshi

Incremental Cycle Detection on Directed Graph

The Tortoise and the Hare in Coq. Constructive extraction via Bar inductive predicates (see README.md below).

Deep object tree observation with cycle prevention

A graph algorithms visualizer written in Java visualizing the solution of the Strong Connectivity, Cycle Detection and Shortest Path problems

This repository contains the source code of the Concurrent Graph Data Structure

Python script for detecting cycles in a directed graph.

This is a web based application which takes as input the image of a handdrawn flow chart with text and polygonal hapes, and digitailzes it.

Creating a dynamic directed multi-graph and performing various operations on it

🔪 Neutralize cycles in (large) graphs

Second task from combinatorial algorithms course.

This program is a simple version of the make command in linux system.

In this python script, you can create an undirected graph then convert it to a acyclic graph

A project developed in java (GUI), that can help universities create a valid 4-year study plan in which it considers the prerequisites of each course and manage how to arrange them. The information of the courses and their prerequisites are read from a CSV file. This project is dedicated for "Algorithm Analysis and Design" course.

Graph algorithms: traversal algorithms, detecting cycle, finding diameter, shortest path algorithms, finding node metrics and coloring algorithms

DFS and all its applications in solving problems related to Graphs

A library for drawing state machines, finding cycles, and manipulating them.

An algorithm used to detect cycles in incremental topological sort graphs