Open Source Algorithms - Page 44
Sort By:
Algorithms
View 6307 business solutions-
Fully Managed MySQL, PostgreSQL, and SQL ServerCloud SQL handles your database ops end to end, so you can focus on your app.
-
Endpoint Management with Remote Control Built InSplashtop AEM handles patching, alerts, scripts, and inventory, and unattended remote control is included. When something needs hands-on work, you’re one click away instead of switching tools.
-
1
Pythonic Data Structures and Algorithms
Minimal examples of data structures and algorithms in Python
The Pythonic Data Structures and Algorithms repository by keon is a hands-on collection of implementations of classical data structures and algorithms written in Python. It offers working, often well-commented code for many standard algorithmic problems — from sorting/searching to graph algorithms, dynamic programming, data structures, and more — making it a valuable resource for learning and reference. For students preparing for technical interviews, self-learners brushing up on fundamentals, or developers wanting to understand algorithm internals, this repository provides ready-to-run examples, and can serve as a sandbox to experiment, benchmark, or adapt code. Because it’s in pure Python, it’s easy to read and modify, making it accessible even to those with modest programming experience. The repo helps bridge the gap between theoretical algorithm descriptions and real-world code, giving concrete, working implementations that one can study, debug, or extend. -
2
QRealFourier
Qt-based FFT implementation
A Qt library for Fast Fourier Transform (FFT) of real samples. Based on the FFTReal library. -
3
software educativo de aplicacion de metaheuristicas sobre problemas de grafos, TSP problema del agente viajero, ruta mas corta, arbol de expansion minima, etc.
-
4
-
Cut Data Warehouse Costs by 54%BigQuery delivers 54% lower TCO with exabyte scale and flexible pricing. Free migration tools handle the SQL translation automatically.
-
5
Quadtree Demo
Demonstrates a quadtree for spatial indexing of triangles
This C++ demo allows users to interactively explore a quadtree's behavior. For this purpose the demo uses a quadtree data structure based on axis-aligned bounding boxes to speed up the search for triangles in a mesh. Depending on a search point all triangles of a quadtree's region are retrieved and relevant information about the search is shown. Quadtree creation can be parametrized by three parameters: - Maximum tree depth. - Maximum number of triangles per region. - Percentage of total number of triangles per region. The OpenGL graphics library is used to render the results, regions as well as the underlying triangle mesh. Navigation (e.g. zooming, moving) is available by keyboard and mouse. Example meshes are provided in wavefront *.obj format and can be opened from inside the program. -
6
-
7
-
8
A Functor / "Function Object" library, providing classes implementing an operator(). A substantial improvement (IMHO) over what the standard provides, with composition, arithmetic expressions, "transform" operations, the naming convention and more.
-
9
QuickMP (Quick Multi-Processing) is a simple cross-platform C++ API for generating parallel for loops in shared-memory programs, similar to OpenMP. It provides automatic scalable performance based on the number of available processors.
-
$300 Free Credits to Build on Google CloudPut your $300 in credit toward real workloads, then keep building with free monthly usage for 20+ products. No commitment and no charge until you upgrade.
-
10
quiplib is a c++ library that contains some classes to simplify you network programing and ACE programming. And implement some important and useful patterns in templates
-
11
R Hadoop for Big Data
Download Free Associated R open source script files for big data analy
Download Free Associated R open source script files for big data analysis with Hadoop and R These are R script source file from Ram Venkat from a past Meetup we did at http://www.meetup.com/R-Matlab-Users/events/85160532/ Also, there is a long video and Powerpoint presentation slide PDF with R files at: http://quantlabs.net/blog/2012/11/how-to-use-hadoop-and-r-for-big-data-parallel-processing-free-download-pdf/ Download source files from http://quantlabs.net/blog/2012/11/download-free-associated-r-open-source-script-files-for-big-data-analysis-with-hadoop-and-r-rstats-hadoop/ -
12
RBush
High-performance JavaScript R-tree-based 2D spatial index
RBush is a high-performance JavaScript library for 2D spatial indexing of points and rectangles. It's based on an optimized R-tree data structure with bulk insertion support. Spatial index is a special data structure for points and rectangles that allows you to perform queries like "all items within this bounding box" very efficiently (e.g. hundreds of times faster than looping over all items). It's most commonly used in maps and data visualizations. The demos contain visualization of trees generated from 50k bulk-loaded random points. Open web console to see benchmarks; click on buttons to insert or remove items; click to perform search under the cursor. An optional argument to RBush defines the maximum number of entries in a tree node. 9 (used by default) is a reasonable choice for most applications. Higher value means faster insertion and slower search, and vice versa. -
13
RL++ is an easy to use modular open source library for Reinforcement Learning written in C++. It includes learning algorithms (TD, Sarsa, Q) as well as the implementation of value function representations (LookupTable, TileCoding, Neuronal Network).
-
14
RPnP-C++
RPnP C++ implemention
I have written the code of RPnP available at http://xuchi.weebly.com/uploads/5/6/7/3/5673896/rpnp1.0.zip in C++ with the help of OpenCV -
15
RSSA
Rejection-based stochastic simulation algorithm (RSSA)
Rejection-based stochastic simulation algorithm (RSSA) is an efficient exact algorithm for doing stochastic simulation of biochemical reaction systems. RSSA improves over state of the art of stochastic simulations by avoiding and collapsing as much the number of propensity updates. -
16
Raiden block cipher: An extremely lightweight and fast block cipher, developed using genetic programming, with the intention to be an alternative to TEA. This cipher is as fast as TEA, and without many of its known weaknesses.
-
17
Random Projection Trees is a recursive space partitioning datastructure which can automatically adapt to the underlying (linear or non-linear) structure in data. It has strong theoretical guarantees on rates of convergence and works well in practice.
-
18
A portable C++ library of multi-threaded STL algorithms (transform, accumulate...) using standard containers and iostreams. Thread, mutex, spinlock are templatized. Close to Intel Threading Building Blocks, HPC++ or PSTL. Idea of A.Stepanov and M.Austen.
-
19
The Rank Aggregation and Evaluation Suite is a comprehensive set of rank aggregation algorithms and performance measurement tools for use in research.
-
20
Rank-BM25
A Collection of BM25 Algorithms in Python
A collection of algorithms for querying a set of documents and returning the ones most relevant to the query. The most common use case for these algorithms is, as you might have guessed, to create search engines. -
21
Rating Algorithms
Library implementating various rating, scoring, ranking algorithms.
The rating algorithms library contains various algorithms used to accurately rank, score or rate collections of similar data. One example is the ranking of votes based on a 5 star scale. This project started as a need of ordering data based on the relevance of each record obtained from users. The first algorithm implemented is based on Wilson Score Interval. -
22
Rating AnalyzerTask for iQser GIN
niPRO AnalyzerTask to calculate the rate popularity
AnalyzerTask for calculating the rate popularity for ContentObjects integrated into the iQser GinServer. Developed by niPRO-Project. -
23
React Fiber Architecture
A description of React's new core algorithm, React Fiber
The React Fiber Architecture project is a detailed technical document that explains the internal design and behavior of React Fiber, the core algorithm that powers modern React rendering. Rather than being a traditional code library, it serves as an educational deep dive into how React manages updates, scheduling, and reconciliation under the hood. The document explores how Fiber replaces the older stack-based reconciliation algorithm with a more flexible system that breaks rendering work into incremental units. This enables advanced features such as interruptible rendering, prioritization of updates, and smoother user interfaces during complex operations. It also introduces the concept of fibers as data structures representing units of work that can be paused, resumed, or reused. The project is especially valuable for developers who want to understand React’s performance model and concurrency features at a low level. -
24
-
25
ReaverSaver
Entorno grafico para el reaver
ReaverSaver es una interfaz gráfica para el crackeo de redes wireless con WPS. Ademas permite salvar las sesiones desde LiveUSB
