DAG-based sorting algorithm minimizing the number of comparison required to find top N items from a list without absolute value
Prettier package.json plugin to make the order of properties nice.
Topological sort of directed ascyclic graphs (like dependecy lists)
Run operations on a graph, maximizing parallelism
Topological sort on directed graphs.
Create a graph from an array of packages
Sort items in a graph using a topological sort while resolving cycles with priority groups
Package implements data structures and algorithms for processing various types of graphs
A graph data structure with topological sort.
Sort an Object or package.json based on the well-known package.json keys
JSS plugin that ensures style properties extend each other instead of override
Fast JavaScript array sorting by implementing Python's Timsort algorithm
Easy autofixable import sorting
PostCSS plugin for sorting and combining CSS media queries with mobile first / **desktop first methodologies
Micro library for sorting arrays using the firstBy().thenBy().thenBy() syntax
Sort the keys of an object
vfile utility to sort messages by line/column
The custom `sort` method (mobile-first / desktop-first) of CSS media queries for `postcss-sort-media-queries`, `css-mqpacker` or `pleeease` (which uses css-mqpacker) or, perhaps, something else ))
Fork of eslint rule that sorts keys in objects (https://eslint.org/docs/rules/sort-keys) with autofix enabled
Sort an object's keys, including an optional key list
Sort array elements in ascending order.
Sort objecy keys by length
Blazing fast, tree-shakeable, type-safe, modern utility library to sort any type of array in less than 1 KB!
Fast and powerful array sorting. Sort an array of objects by one or more properties. Any number of nested properties or custom comparison functions may be used.
Topologically sorts a Directed Acyclic Graph using Kahn's Algorithm. Lets you include some custom data on each node.
Generic implementation of DFS for topological sorting.
mvGraph is an implementation of the graph data structure in Ruby. \ It was created to solve some classic AI search problems; as such, it currently supports BFS, DFS, any user-defined heuristic search, as well as A*.
Topological sorting, shortest path, and json exports for directed acyclic graphs
Build and resolve dependency graphs using topological sort, detect cycles, generate parallel execution batches, query dependencies and dependents, find shortest paths, and extract subgraphs.
Graph data structure supporting directed and undirected modes with adjacency list storage. Includes BFS, DFS, Dijkstra shortest path, topological sort, cycle detection, connected components, minimum spanning tree, maximum flow, graph coloring, bipartiteness checking, strongly connected components, and DOT/JSON serialization.
This library is based on GRATR and RGL. Graph algorithms currently provided are: * Topological Sort * Strongly Connected Components * Transitive Closure * Rural Chinese Postman * Biconnected
Utilities for enhanced functionality. Includes Graph, Sorting, Parsing, and a Neural Network implemenation. Source is at https://github.com/mananshah99/rbutils.
A ruby gem for concurrent tasks scheduling and resolving dependencies based on directed acyclic graphs and modified topological sorting algorithm.
GRATR is a framework for graph data structures and algorithms. This library is a fork of RGL. This version utilizes Ruby blocks and duck typing to greatly simplfy the code. It also supports export to DOT format for display as graphics. GRATR currently contains a core set of algorithm patterns: * Breadth First Search * Depth First Search * A* Search * Floyd-Warshall * Best First Search * Djikstra's Algorithm * Lexicographic Search The algorithm patterns by themselves do not compute any meaningful quantities over graphs, they are merely building blocks for constructing graph algorithms. The graph algorithms in GRATR currently include: * Topological Sort * Strongly Connected Components * Transitive Closure * Rural Chinese Postman * Biconnected
GRATR is a framework for graph data structures and algorithms. This library is a fork of RGL. This version utilizes Ruby blocks and duck typing to greatly simplfy the code. It also supports export to DOT format for display as graphics. GRATR currently contains a core set of algorithm patterns: * Breadth First Search * Depth First Search * A* Search * Floyd-Warshall * Best First Search * Djikstra's Algorithm * Lexicographic Search The algorithm patterns by themselves do not compute any meaningful quantities over graphs, they are merely building blocks for constructing graph algorithms. The graph algorithms in GRATR currently include: * Topological Sort * Strongly Connected Components * Transitive Closure * Rural Chinese Postman * Biconnected
Transaction::Simple provides a generic way to add active transaction support to objects. The transaction methods added by this module will work with most objects, excluding those that cannot be Marshal-ed (bindings, procedure objects, IO instances, or singleton objects). The transactions supported by Transaction::Simple are not associated with any sort of data store. They are "live" transactions occurring in memory on the object itself. This is to allow "test" changes to be made to an object before making the changes permanent. Transaction::Simple can handle an "infinite" number of transaction levels (limited only by memory). If I open two transactions, commit the second, but abort the first, the object will revert to the original version. Transaction::Simple supports "named" transactions, so that multiple levels of transactions can be committed, aborted, or rewound by referring to the appropriate name of the transaction. Names may be any object except nil. Transaction groups are also supported. A transaction group is an object wrapper that manages a group of objects as if they were a single object for the purpose of transaction management. All transactions for this group of objects should be performed against the transaction group object, not against individual objects in the group. Version 1.4.0 of Transaction::Simple adds a new post-rewind hook so that complex graph objects of the type in tests/tc_broken_graph.rb can correct themselves. Version 1.4.0.1 just fixes a simple bug with #transaction method handling during the deprecation warning. Version 1.4.0.2 is a small update for people who use Transaction::Simple in bundler (adding lib/transaction-simple.rb) and other scenarios where having Hoe as a runtime dependency (a bug fixed in Hoe several years ago, but not visible in Transaction::Simple because it has not needed a re-release). All of the files internally have also been marked as UTF-8, ensuring full Ruby 1.9 compatibility.
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.