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.

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

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

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

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

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

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

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.

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.

Hung-Yi Lee Linear Algebra 2018 Fall Homework

Hung-Yi Lee Linear Algebra 2018 Fall Homework

Implementation of various complex algorithms that are graph related and used in the real world applications.

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

Implement of Distributed cycle detection in large-scale sparse graphs

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

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