OCaml graph library
Die Hauptfunktionen von backtracking/ocamlgraph sind: Algorithms and Data Structures.
Open-Source-Alternativen zu backtracking/ocamlgraph sind unter anderem: 0xax/go-algorithms — This library provides a comprehensive collection of fundamental computer science primitives implemented in Go. It… aalhour/c-sharp-algorithms — This project is a C# algorithms library and collection of data structures. It serves as a computer science reference… akade/akade.indexedset — A convenient data structure supporting efficient in-memory indexing and querying, including range queries and fuzzy… aggelgian/erlang-algorithms — Implementations of popular data structures and algorithms. abvdasker/crystal-linked-list — Simple linked list implementation in Crystal. a115/exmatrix — Elixir library implementing a parallel matrix multiplication algorithm and other utilities for working with matrices.…
This library provides a comprehensive collection of fundamental computer science primitives implemented in Go. It serves as a resource for both educational purposes and production applications, offering standard tools for organizing, searching, and sorting data. The implementation leverages language-level type parameters to ensure type safety while maintaining flexibility across different data types. It utilizes interface-driven polymorphism and pointer-based memory management to define common behaviors and handle complex structures. To optimize performance, the library employs in-place data
This project is a C# algorithms library and collection of data structures. It serves as a computer science reference providing practical implementations of classic sorting, searching, and graph traversal patterns. The library includes a dedicated string processing toolkit for analyzing text similarity, computing edit distances, and managing prefix-based searches. It also features a graph theory implementation for modeling network relationships and calculating shortest paths. The codebase covers a broad range of capabilities, including the management of linear and hierarchical collections, tr
Simple linked list implementation in Crystal
Elixir library implementing a parallel matrix multiplication algorithm and other utilities for working with matrices. Used for benchmarking computationally intensive concurrent code.