A Python package for analyzing the Hofstadter model.
-
Updated
Jun 10, 2024 - Python
A Python package for analyzing the Hofstadter model.
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.
Analyzes the order in which classes must be compiled (Class Dependency Graph + Topological Sort + Cycle Detection). Implemented in Java with GUI
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.
My PhD thesis "Aspects on Tensor Networks for Topological Orders"
Introduces interfaces and basic classes for topoligic comparable types. Topologic comparable types can have multiple sorted enumerations.
Topological sort (Kahn algorithm) an oriented graph containing any kind of node, using ES6 Maps & Sets.
Where to Start?
Sort, Search, Graph Algorithms naively implemented in Kotlin for learning purpose
Easy to use and user-friendly topological sort module for OCaml
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.
Run promises in order of a directed acyclic graph
Kohonen Self-Organizing Maps (SOMs) for dimensionality reduction, data embedding, and solving a variant of the travelling salesman problem.
Implementation of various complex algorithms that are graph related and used in the real world applications.
Implementation of the parallel version of the Kahn algorithm (Topological Order).
Implementation of data structures (Lists, Stacks, Queues, Trees, Balanced Search Trees, Hashing, Graphs); Implementation of algorithms (Sorting and searching, Recursion, Graph algorithms).
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.
Implementation of Depth First Search algorithm for a Directed Acyclic Graph, Connected Components and Topological Orderings using rbk/Graph.java.
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.
Add a description, image, and links to the topological-order topic page so that developers can more easily learn about it.
To associate your repository with the topological-order topic, visit your repo's landing page and select "manage topics."