Topological sort
Topological sorting with grouping support
Topological is a framework for building stream processing topologies, inspired by decades old dataflow processing patterns and more modern platforms like Apache Storm, that were designed to be as much about the distributed cluster they had to stand up as
Topological sort on directed graphs.
A graph data structure with topological sort.
Topological sort of directed ascyclic graphs (like dependecy lists)
Topological sort of directed acyclic graphs (like dependecy lists)
Topological indexing for simplicial complexes
Topological sorting and cycle detection. Optional grouping for parallel processing
Geometry library for topological robustness
Sort items in a graph using a topological sort
Sort items in a graph using a topological sort while resolving cycles with priority groups
Topological sort utility for directed acyclic graphs.
A tiny dependency solver using topological sorting
Sort items in a graph using a topological sort while resolving cycles with priority groups
A graph data structure with topological sort.
Topological sort in JavaScript
Bun-native TypeScript workspace script runner with topological ordering
Topological sorting
High-Performance topological sort / dependency resolver with optional grouping algorithm for Typescript
Topological sort of directed ascyclic graphs (like dependecy lists)
Topological sort on directed graphs.
Topological sorting with grouping support
A topological graph implementation using d3 graphs.
Topological data structures for the DeepCausality project
biquad filters from the surge synthesizer
Topological tools for geometric structures - homology, persistent homology, Morse theory, and manifold analysis
A graph-based LLM white-box optimization toolbox: topology validation, Lie group orthogonalization, tensor ring compression
Cova's geometric and topological library
Flow topology graph structures for ObzenFlow
Topological sorting algorithm for directed graphs.
High-performance quantum circuit scheduler for multi-job quantum computing with OpenQASM 3
First principles, minimally dependent, geometric and topologically focused math library
D-dimensional Delaunay triangulations and convex hulls in Rust, with exact predicates, multi-level validation, and bistellar flips
Topological Data Analysis for neural networks - persistent homology and topological features
Storage-agnostic core traits for discrete topology views.
Generic implementation of DFS for topological sorting.
Core Models and Schema for the Topological Inventory Service..
Common classes for topological-inventory collectors/operations
Topological Inventory
Topological Inventory Ingress API
Topological sorting using Tarjan's algorithm
Topological Inventory Persister
topology.
An ffi wrapper for GEOS, a C++ port of the Java Topology Suite (JTS).
Build and resolve dependency graphs using topological sort, detect cycles, generate parallel execution batches, query dependencies and dependents, find shortest paths, and extract subgraphs.
RubyNEAT -- Neural Evolution of Augmenting Topologies for Ruby. By way of an enhanced form of Genetic Algorithms -- the NEAT algorithm, populations of neural nets are evolved to handle pre-defined goals. RubyNEAT is the first implementation of the NEAT algorithm for Ruby, and it leverages Ruby's power to implement the NEAT algorithm in a way that would be difficult to do in other languages. The 'activation function' is largely standalone. Basically, activation is achieved by functional programming. Meaning, once your network is evolved, you can extract it as source code you can then utilize without the RubyNEAT engine. RubyNEAT can be used for nearly any Machine Learning task you can dream of, because it's also extensible and modular. See http://rubyneat.com for the details.
Knife-topo uses a JSON file to capture a topology of nodes, which can be loaded into Chef and bootstrapped
No description provided.
No description provided.
No description provided.
No description provided.
No description provided.
No description provided.
No description provided.
No description provided.
No description provided.
No description provided.
No description provided.
No description provided.