C# dependency analyzer

Header-Only C++ Library for Graph Representation and Algorithms

Identifies and prioritizes God Classes Highly Coupled classes, and Class Cycles in Java codebases you should refactor first.

Efficient implementation of Langton's Ant cellular automata on an infinite grid for cooperative highway search

neXus - A Comprehensive Graph Algorithm Library for C++

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.

Breaks cycle-induced rigidity in LLM-driven tasks, untangling complexity traps for streamlined outcomes

Useful data structures and algorithms mostly related to Graphs.

A C program that simulates an election using the Tideman (ranked pairs) voting method, identifying the Condorcet winner if one exists. Implements graph-based logic, adjacency matrices, sorting algorithms, and cycle detection to determine the election outcome.

Various data structures and algorithms implemented using C++

Implementing graph algorithms to analyze city networks like cycle detection, shortest path, MST, and strong connectivity in Python

Solution to a graph theory problem meeting a specific time complexity constraint. Developed in C++ using the breadth-first search algorithm. Created in December 2021 as part of the Design and Analysis of Algorithms course, with a presentation delivered in January 2022.

Set of tools for graph manipulation and analysis, including pathfinding algorithms and cycle detection.

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

This is Tideman, a command-line program written in C that emulates a rank-choice voting election on an array of candidates.

This Repo contains all data related to graph theory for CP

A Directed Acyclic Graph (DAG) library with online cycle detection and topological ordering.

Typescript implementation of graphs.