这是一个用 Rust 编写的标准数据结构和算法实现合集。它提供了一套专为竞赛编程和系统工程设计的专业库。
The main features of ebtech/rust-algorithms are: Competitive Programming Toolkits, Competitive Programming Libraries, Graph Libraries, Adjacency Lists, Network Flow Algorithms, Minimum Spanning Tree Algorithms, Graph Algorithm Routines, Lazy Propagation.
Open-source alternatives to ebtech/rust-algorithms include: coells/100days — This project is a comprehensive collection of computer science implementations and an algorithm tutorial repository.… petgraph/petgraph — petgraph is a graph data structure library for the Rust programming language. It provides a collection of tools for… wisdompeak/leetcode — This project is a curated library of algorithm implementations and solved programming problems. It serves as a… kevin-wayne/algs4 — algs4 is a Java data structures library and algorithm reference collection designed as the source code for a standard… xtaci/algorithms — This is a collection of classical algorithms and data structures implemented as a header-only C++ library. It provides… oi-wiki/oi-wiki — This project is a comprehensive, community-maintained knowledge base and toolkit designed for competitive programming.…
This project is a comprehensive collection of computer science implementations and an algorithm tutorial repository. It serves as a study guide and reference for competitive programming, providing executable code examples that demonstrate fundamental algorithmic problem solving and mathematical computation. The library covers a wide range of specialized domains, including cryptography and security primitives, lossless data compression techniques, and computational geometry for spatial analysis. It also features implementations of machine learning models, linear algebra operations, and formal
This project is a curated library of algorithm implementations and solved programming problems. It serves as a reference repository for competitive programming and data structure implementations, providing optimized solutions for a wide range of coding challenges. The collection organizes code examples by algorithmic technique, specifically focusing on the implementation of trees, graphs, and heaps to optimize time and space complexity. It provides language-specific solutions used for high-performance coding tasks. The repository covers a broad set of capabilities, including graph traversals
petgraph is a graph data structure library for the Rust programming language. It provides a collection of tools for representing and manipulating graphs, functioning as a network analysis tool and a comprehensive graph algorithm suite. The library integrates with Graphviz DOT for importing, exporting, and parsing graph data to facilitate visualization. It distinguishes itself by offering specialized network analysis capabilities, such as the detection of cliques, bridge edges, articulation points, and subgraph isomorphisms. Its computational surface covers a wide range of algorithms, includi
algs4 is a Java data structures library and algorithm reference collection designed as the source code for a standard computer science textbook curriculum. It provides a comprehensive suite of fundamental implementations for sorting, searching, and core data organization. The project serves as a graph theory framework, offering tools for representing directed and undirected graphs and performing complex traversals and pathfinding. It also includes a broad sorting algorithm suite and a specialized library of Java data structures, including stacks, queues, priority queues, and symbol tables. I