Easy to use and user-friendly topological sort module for OCaml

A Python package for analyzing the Hofstadter model.

My PhD thesis "Aspects on Tensor Networks for Topological Orders"

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

Implementation of data structures (Lists, Stacks, Queues, Trees, Balanced Search Trees, Hashing, Graphs); Implementation of algorithms (Sorting and searching, Recursion, Graph algorithms).

Sort, Search, Graph Algorithms naively implemented in Kotlin for learning purpose

Enumeration of all Permutations (Recursion, Single Swap, and in Lexicographic Order), and Combinations. Enumeration of all Topological Orderings on a Directed Graph. Enumeration of all Paths in a connected Graph. Evaluates Critical Path using PERT Algorithm.

Run promises in order of a directed acyclic graph

Implementation of Depth First Search algorithm for a Directed Acyclic Graph, Connected Components and Topological Orderings using rbk/Graph.java.

GitVision is a groundbreaking web tool that transforms Git repositories into immersive 3D, Virtual, and Augmented reality visualizations. It provides a novel approach to understanding Git's version control system, making it more intuitive, efficient, and engaging.

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

Implementation of DFS - strongly connected components on a Directed Graph, using same Object Oriented approach from SP08. Implementation of two versions of partition algorithms of Quick Sort and their comparison. Implementation of Dual-Pivot Quick Sort Algorithm.

Implementation of an Algorithm to find Diameter of a Tree (represented as a Graph) using BFS, to find Odd-Length Cycle in a Tree. Implementation of Enumeration of all Paths in a connected Graph, and Enumeration of all permutation with alternate parities.

A modified version of Kahn's algorithm for topological sorting to resolve dependencies of asynchronous tasks.

Where to Start?

Analyzes the order in which classes must be compiled (Class Dependency Graph + Topological Sort + Cycle Detection). Implemented in Java with GUI

For Computations of Brauer Picard

LaTeX / XeLaTeX scripts supporting the graphical rendering of Hasse diagrams for lattices

Kohonen Self-Organizing Maps (SOMs) for dimensionality reduction, data embedding, and solving a variant of the travelling salesman problem.

The official implementation of Learned DFS Ordering (LDFS) algorithm in the paper "Incremental Topological Ordering and Cycle Detection with Predictions" by McCauley, S., Moseley, B., Niaparast, A. and Singh, S.