A simple cycle detection library.
Dithers an image using the Floyd-Steinberg algorithm
TypeScript definitions for floyd-steinberg
The Floyd-Rivest k-smallest selection algorithm.
AWS IAM policy statement generator with fluent interface for AWS CDK
AWS IAM policy statement generator with fluent interface
Algorithm for finding shortest paths in a weighted graph with positive or negative edge weights (but with no negative cycles)
Brazilian document validators (CPF/CNPJ) for Floyd SDK
Official Node.js SDK for the Floyd Blockchain API
Webhook handling SDK for the Floyd Blockchain API
n8n community node for Floyd - atomic booking holds for AI agent workflows
TypeScript type definitions for the Floyd Blockchain API
Image dithering using floyd-steinberg algo
Lightning-fast median finding with O(n) average time complexity using Floyd-Rivest algorithm
A tiny and fast selection algorithm in JavaScript.
Multicolor Floyd Steinberg dithering.
digital fundamentals thomas l floyd solution manual zip portable
A CDK construct that helps build IAM policies using the AWS IAM Policy Builder dump. Normally it is better to use cdk-iam-floyd, However, I found that cdk-iam-floyd currently is not jsii compliant so I wasn't able to use it in my jsii compliant projects i
Floyd Kim
Pink Floyd npm module!
Dijkstra & Floyd Warshall implementation for weighted directed and undirected graphs with iteration logging.
floyd
Floyd–Steinberg image dithering compiled to WebAssembly with a JS-friendly API.
Get the median value in an array
Open-source MC/DC coverage engine for Rust, focused on automotive safety-critical code (ISO 26262, ASIL-D, TCL3).
Floyd-Warshall algorithm supporting customization.
A generic implementation of the Floyd-Warshall algorithm for array-like types.
A image dithering toolkit for applying various dithering algorithms to images.
Cargo subcommand for the Floyd Rust MC/DC coverage engine.
Efficient all-pairs-shortest-paths algorithm for the petgraph library using the floyd-warshall algorithm.
Shortest/longest path algorithms, where edge weight accumulation via either a sum or a product
Convert images to braille Unicode ASCII art
A lightweight crate that brings the Floyd-Rivest implementation of nth_element.
gif to ascii art converter written in rust
Smart filter to remove Floyd-Steinberg dithering from paletted images
A comprehensive library of advanced algorithms for numerical analysis, linear algebra, cryptography, optimization, and graph theory
Floyd.
Finds the shortest paths between all pairs of nodes of a graph
Prints the lyrics to Pink Floyd's song Shine On You Crazy Diamond from the album Wish You Were Here
This gem is a Ruby implementation of the Schulze voting method (with help of the Floyd-Warshall algorithm), a type of the Condorcet voting methods.
BASIC INSTRUCTIONS This gem re-ranks your playlist according to Pink Floyd band members chosen at random. The re-ranked playlist is then exported to your current directory after the program has finished ('quit' to exit). TO RUN DEFAULT CSV SHEET (Some songs from 'The Wall')): songfile TO RUN DARK SIDE OF THE MOON ALBUM SONGS: songfile bin/DSOTM.csv TO RUN A CSV FILE FROM YOUR CURRENT DIRECTORY: songfile your_file_name.csv NOTE: All CSV files must be formatted appropriately with: No header or other text at the top! Column 1: lists all song titles in plain text (The program will appropriately capitalize titles for you.) Column 2: lists integer values for your song ranks (Any negative character "-" will be ignored. If left blank, a default rank of 10,000 is given.) Low rank # means you want the song ranked higher on the playlist. High rank # means you want the song ranked lower on the playlist.
This gem is a Ruby implementation of the Schulze voting method (using Floyd–Warshall algorithm), a type of the Condorcet voting methods.
Provides a simple way to find the shortest path in a graph of Rails records using Floyd's 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
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.