Header-Only C++ Library for Graph Representation and Algorithms
-
Updated
Sep 10, 2026 - C++
Header-Only C++ Library for Graph Representation and Algorithms
Identifies and prioritizes Class and Package Cycles and Anti-pattens in Java & Kotlin codebases you should refactor first.
AlphaSQL provides Integrated Type and Schema Check and Parallelization for SQL file set mainly for BigQuery
A Python implementation demonstrating three fundamental linked list techniques with clear examples and detailed explanations. Features Multiple Pass, Temporary Head, and Fast-Slow Pointer algorithms for common linked list operations including finding middle elements, reversing lists, and cycle detection.
Efficient implementation of Langton's Ant cellular automata on an infinite grid for cooperative highway search
A graph algorithms visualizer written in Java visualizing the solution of the Strong Connectivity, Cycle Detection and Shortest Path problems
C# dependency analyzer
Hung-Yi Lee Linear Algebra 2018 Fall Homework
Implementation of various complex algorithms that are graph related and used in the real world applications.
Find strongly connected components of a directed graph using Tarjan's algorithm
A lightweight, framework-agnostic loop detection library for LLM agents. Detects repeated tool calls, identical inputs, unchanged outputs, and stalled execution before they become infinite loops. Returns actionable recovery suggestions and integrates into any Node.js AI agent with just two function calls.
Implement of Distributed cycle detection in large-scale sparse graphs
Wait-For Graph (WFG) deadlock detection engine with cycle discovery and victim transaction termination policies.
Wait-For Graph (WFG) deadlock detection engine with cycle discovery and victim transaction termination policies.
Directed acyclic graph (DAG) topological sorting and Tarjan's strongly connected components (SCC) engine for agent dependency resolution.
Directed acyclic graph (DAG) topological sorting and Tarjan's strongly connected components (SCC) engine for agent dependency resolution.
Reference counting engine with Bacon-Rajan trial deletion cycle collection
Reference counting engine with Bacon-Rajan trial deletion cycle collection
Research into algorithms and techniques for faster cycle enumeration on undirected graphs (LDPC Codes).
To associate your repository with the cycle-detection topic, visit your repo's landing page and select "manage topics."