Run promises in order of a directed acyclic graph

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.

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

Finds a Topological Ordering of vertices in a Directed Acyclic Graph

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

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

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

Introduces interfaces and basic classes for topoligic comparable types. Topologic comparable types can have multiple sorted enumerations.

Where to Start?

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

Notes on attempt to build the operator representation of the Heisenberg spin-1 edge modes.

Short notes on Majoranas on supersymmetric kagome model

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

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.

Implementation of the parallel version of the Kahn algorithm (Topological Order).

Este repositorio contiene el código fuente del Proyecto de Primer Bimestre de la materia de Estructuras de Datos y algoritmos II. Dada una malla curricular, este algoritmo devuelve el orden topológico de las materias, en otras palabras: En que orden pueden los alumnos tomar las materias hasta graduarse.