Browse free open source JavaScript Algorithms and projects below. Use the toggles on the left to filter open source JavaScript Algorithms by OS, license, language, programming language, and project status.

  • Train ML Models With SQL You Already Know Icon
    Train ML Models With SQL You Already Know

    BigQuery automates data prep, analysis, and predictions with built-in AI assistance.

    Build and deploy ML models using familiar SQL. Automate data prep with built-in Gemini. Query 1 TB and store 10 GB free monthly.
    Start Free
  • Build Agents and Models on One Platform Icon
    Build Agents and Models on One Platform

    Everything you need to build production-ready agents and models. Access 200+ Google and third-party AI models and tools.

    Gemini Enterprise Agent Platform is Google Cloud's comprehensive platform for developers to build, scale, govern, and optimize agents and models. Choose from Google's most advanced models and third-party models like Anthropic's Claude Model Family.
    Start Free
  • 1
    JavaBlock
    Free Java Flowchart simulator / interpreter
    Leader badge
    Downloads: 239 This Week
    Last Update:
    See Project
  • 2
    Flatbush

    Flatbush

    A very fast static spatial index for 2D points and rectangles in JS

    A really fast static spatial index for 2D points and rectangles in JavaScript. An efficient implementation of the packed Hilbert R-tree algorithm. Enables fast spatial queries on a very large number of objects (e.g. millions), which is very useful in maps, data visualizations and computational geometry algorithms.
    Downloads: 7 This Week
    Last Update:
    See Project
  • 3
    Delaunator

    Delaunator

    Fast JavaScript library for Delaunay triangulation of 2D points

    Delaunator is a fast library for Delaunay triangulation. It takes as input a set of points. The triangulation is represented as compact arrays of integers. It’s less convenient than other representations but is the reason the library is fast. After constructing a delaunay = Delaunator.from(points) object, it will have a triangles array and a halfedges array, both indexed by half-edge id. What’s a half-edge? A triangle edge may be shared with another triangle. Instead of thinking about each edge A↔︎B, we will use two half-edges A→B and B→A. Having two half-edges is the key to everything this library provides. It will also be useful to have some helper functions to go from one half-edge to the next and previous half-edges in the same triangle. We can draw all the triangle edges without constructing the triangles themselves.
    Downloads: 4 This Week
    Last Update:
    See Project
  • 4
    ipytracer

    ipytracer

    Algorithm Visualizer for IPython/Jupyter Notebook

    Algorithm Visualizer for IPython/Jupyter Notebook. If you use the display(TracerObject) code from where you want to see, you can use it without any special modification.
    Downloads: 3 This Week
    Last Update:
    See Project
  • Paessler: Easy to Use With Enterprise Power. Free Trial Icon
    Paessler: Easy to Use With Enterprise Power. Free Trial

    A low-code dashboard makes monitoring intuitive for any admin, while scripting and custom sensors give experts full control.

    You shouldn't have to choose between a monitoring tool that's easy to use and one that's powerful enough for a complex environment. PRTG's low-code interface lets any admin build dashboards, set alerts and monitor devices without scripting, while custom sensors and full API access are there when your team needs deeper control. One platform, no compromise. Download a free 30-day trial now.
    Get Free Download
  • 5
    RBush

    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.
    Downloads: 2 This Week
    Last Update:
    See Project
  • 6
    frontend-interview

    frontend-interview

    The strongest front-end interview guide in the universe

    This is a review summary project about preparing for front-end interviews that I have summarized, and the project is updated from time to time. This is not only a strategy for job interviews, but also a collection of front-end ers to examine themselves and achieve breakthroughs. I hope that through this guide, everyone can open up their own lines of Ren and Du, and go further on the road to the front. This warehouse uses a large number of diagrams to convey knowledge. The so-called picture is worth a thousand words. I hope that this kind of graphic expression will make it easier for you to remember some abstract and incomprehensible concepts. "Graphic Front End" is my subtitle to it. Interviewing is a very subjective and difficult thing. Just because you don't pass the interview doesn't mean you're unqualified, just like passing the interview doesn't mean you're qualified. As a candidate, you are usually given 45 minutes to demonstrate your skills.
    Downloads: 2 This Week
    Last Update:
    See Project
  • 7
    Illustrated Algorithms

    Illustrated Algorithms

    Interactive algorithm visualizations

    Inspired by Grokking Algorithms and python-execution-trace, this project aims to reveal the mechanics behind algorithms via interactive visualizations of their execution. Visual representations of variables and operations augment the control flow, alongside actual source code. You can fast forward and rewind the execution to closely observe how an algorithm works. The same code that is displayed next to the illustration is also decorated using babel-plugin-trace-execution and executed to record the context at every step. Literally the same source file. Going back and forth between function execution (and call stack when algorithm uses recursion) is effortless. So is pausing and resuming. This project uses styled-jsx, but takes the idea of CSS-in-JS even further. Sizing, positioning and transition offsets are computed by JS, all before elements hit the DOM.
    Downloads: 1 This Week
    Last Update:
    See Project
  • 8
    ngraph.path

    ngraph.path

    Path finding in a graph

    ngraph.path is a JavaScript library that implements efficient pathfinding algorithms for graphs, primarily designed to compute shortest paths in weighted or unweighted networks. It provides a clean API for constructing graph models, assigning weights to edges, and querying for optimal routes between nodes, making it useful for routing, games, maps, and network optimization. The library includes several algorithm implementations such as A*, Dijkstra’s, and breadth-first search, each suited to different types of graph structure and performance needs. It can be integrated with visualization libraries like VivaGraphJS to animate or highlight computed paths in a rendered graph, enabling interactive routing features. Its data structures and algorithm choices are optimized for performance and memory efficiency, so even large meshes or road networks can be navigated interactively. With its standalone design, ngraph.path can be used in browser apps, server-side Node.js services.
    Downloads: 1 This Week
    Last Update:
    See Project
  • 9
    supercluster

    supercluster

    A very fast geospatial point clustering library for browsers and Node

    A very fast JavaScript library for geospatial point clustering for browsers and Node. supercluster supports property aggregation with the following two options. Map, a function that returns cluster properties corresponding to a single point. Reduce, a reduce function that merges properties of two clusters into one.
    Downloads: 1 This Week
    Last Update:
    See Project
  • Build Data Resilience - Take the Assessment Today Icon
    Build Data Resilience - Take the Assessment Today

    Can you recover when it matters most? Take this quick assessment to identify gaps and build greater recovery confidence.

    Is your recovery strategy as strong as you think? Take this quick self-assessment to check your recovery readiness and gain tailored insights. In only 2 minutes, you'll learn where you fall on the recovery readiness scale.
    Take the Assessment
  • 10
    Javascript Clipper

    Javascript Clipper

    Boolean operations and offsetting library in Javascript

    The Javascript Clipper library performs clipping and offsetting for both lines and polygons. All four boolean clipping operations are supported - intersection, union, difference and exclusive-or. Polygons can be of any shape including self-intersecting polygons. Javascript Clipper is a port of Angus Johnson's Clipper library: https://sourceforge.net/projects/polyclipping LIVE DEMO: http://jsclipper.sourceforge.net/6.4.2.2/main_demo.html LIVE DEMO (FPoint): http://jsclipper.sourceforge.net/6.4.2.2_fpoint/main_demo.html Information and examples: http://jsclipper.sourceforge.net/6.4.2.2 Information and examples (FPoint): http://jsclipper.sourceforge.net/6.4.2.2_fpoint Donate Javascript Clipper Project: https://sourceforge.net/p/jsclipper/wiki/Donations/ Use cases: * Over 1500 schools in the UK uses Javascript Clipper in Digimap for Schools service. Read more: https://mobilegeo.wordpress.com and http://digimapforschools.edina.ac.uk/cosmo-free/osmapper
    Downloads: 4 This Week
    Last Update:
    See Project
  • 11
    Flamingo Project

    Flamingo Project

    Workflow Designer, Hive Editor, Pig Editor, File System Browser

    Flamingo is a open-source Big Data Platform that combine a Ajax Rich Web Interface + Workflow Engine + Workflow Designer + MapReduce + Hive Editor + Pig Editor. 1. Easy Tool for big data 2. Use comfortable in Hadoop EcoSystem projects 3. Based GPL V3 License Supporting Pig IDE, Hive IDE, HDFS Browser, Scheduler, Hadoop Job Monitoring, Workflow Engine, Workflow Designer, MapReduce.
    Downloads: 1 This Week
    Last Update:
    See Project
  • 12

    2D-Physics-Engine

    2D physics engine and simulation

    Simulate 2D physics with my engine entirely made in JavaScript. Modify live existing scenarii or create your own from scratch with the live editor. Try it on the demo web site! :) Note : If you intend to download and use the sources as it is, you need to host it as scenario resquests are made in AJAX.
    Downloads: 1 This Week
    Last Update:
    See Project
  • 13
    Tpl makes it easy to serialize your C data using just a handful of API functions. The data is stored in its native binary form for maximum efficiency. C, Perl and XML supported. Data is portable across CPU types and OS's from Unix to Mac to Windows.
    Downloads: 1 This Week
    Last Update:
    See Project
  • 14
    AIS is an Development Platform providing a high-speed JIT compiler for LISP and JavaScript, web server, object repositories, MySQL integration and libraries supporting a wide variety of advanced genetic programming and symbolic regression techniques.
    Downloads: 0 This Week
    Last Update:
    See Project
  • 15
    Analytic Toolkit
    The purpose of the project is summarising effort from a number of analytic libraries, adding interactive web-based user interface and making a free open source solution for risk analytics and stress testing. Feb 8, 2012 Paul Glasserman's Importance Sampling and Tail Approximations as well as plain Monte Carlo have been implemented for for the widely used normal copula model of portfolio credit risk. The package includes source code, examples, spreadsheet with results and references to the papers.
    Downloads: 0 This Week
    Last Update:
    See Project
  • 16
    The main goal of the Analytical Customer Relationship Management system is to improve services provided to customers, and to use customer contact information for targeted marketing.
    Downloads: 0 This Week
    Last Update:
    See Project
  • 17
    For arbitrary precision mathematics PHP offers the Binary Calculator which supports numbers of any size and precision, represented as strings. This project replicates this in JavaScript (bcadd, bccomp, bcdiv, bcmul, bcsub, etc)
    Downloads: 0 This Week
    Last Update:
    See Project
  • 18
    Chess Rating Management System
    This sofware is designed to help different chess clubs to set up their own rating system. It uses USCF approximation formulas for rating calculations. Working example at newarkcc.vfutbole.ru
    Downloads: 0 This Week
    Last Update:
    See Project
  • 19

    ContainerValidator.JS

    Cargo container validator ISO 6346 in Javascript

    Downloads: 0 This Week
    Last Update:
    See Project
  • 20
    Data Structures and Algorithms in JS

    Data Structures and Algorithms in JS

    Data Structures and Algorithms explained and implemented in JavaScript

    Are you a JavaScript developer looking to improve your craft? Then, this algorithms book is for you. This material contains the fundamental concepts to move your career to the next level. You will be able to solve problems faster in your day-to-day work and ace technical job interviews. Simply put, algorithms are several steps to solve a specific problem (e.g., sort number, search value, transform data, etc.). Algorithms are an essential toolbox for every programmer. Even if you don't realize it, you use them every day. They are built-in in apps, programming languages, and libraries. However, to make use of them properly, you have to know the tradeoffs so you can choose the best tool for the job. Improve your problem-solving skills and become a stronger developer by understanding fundamental computer science concepts.
    Downloads: 0 This Week
    Last Update:
    See Project
  • 21
    Robust Perl OO Module for Digest based Authentication leveraging DBI as a backend. This Performance oriented Hash Authentication Library is scalable from single pc to multi-database single signon www applications. Optionally uses Javascript and Cookies.
    Downloads: 0 This Week
    Last Update:
    See Project
  • 22
    Free scripts & examples- JSP, Eclipse, SQL, PHP, ASP, Win32 Batch, Javascript, Flash/Actionscript. -=-=-=-=-=-=- NOTE: This project is closed. For new development related to integrating Beyond Compare with Eclipse, see http://beyondcvs.sourceforge.net/
    Downloads: 0 This Week
    Last Update:
    See Project
  • 23
    Gamoliyas is an open source John Conway's Game of Life game totally written in DHTML (JavaScript, CSS and HTML). Uses mouse and keyboard. Very configurable. This cross-platform and cross-browser game was tested under BeOS, Linux, *BSD, Windows and other
    Downloads: 0 This Week
    Last Update:
    See Project
  • 24
    GraphScript project is a network theory simulator based purely on Java and Java scripting engines. It is intended to allow fast development, testing and visualization of network theory (graph) algorithms.
    Downloads: 0 This Week
    Last Update:
    See Project
  • 25
    VB and JavaScript code which validates 10 and 13 digit ISBN, and converts between ISBN-10 and ISBN-13 (only ISBN-13 beginning with 978 can be converted to ISBN-10). May be useful during the January 2007 world-wide changeover to ISBN-13.
    Downloads: 0 This Week
    Last Update:
    See Project
  • Previous
  • You're on page 1
  • 2
  • 3
  • Next