Search Results for "live-graph"
Sort By:
Showing 45 open source projects for "live-graph"
View related business solutions-
$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.
-
Train ML Models With SQL You Already KnowBuild and deploy ML models using familiar SQL. Automate data prep with built-in Gemini. Query 1 TB and store 10 GB free monthly.
-
1
GraphEmbedding
Implementation and experiments of graph embedding algorithms
GraphEmbedding is an open-source Python project for implementing and experimenting with graph embedding algorithms. It follows a simple “graph in, embedding out” design. The library uses NetworkX graphs as input and produces vector representations for graph nodes. It includes implementations of DeepWalk, LINE, Node2Vec, SDNE, and Struc2Vec. Users can configure walks, embedding dimensions, training windows, epochs, and other model-specific parameters. -
2
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. ... -
3
The Algorithms Python
All Algorithms implemented in Python
...Each implementation is designed with clarity in mind, favoring readability and comprehension over performance optimization. The project covers various domains including mathematics, cryptography, machine learning, sorting, graph theory, and more. With contributions from a large global community, it continually grows and improves through collaboration and peer review. This repository is an ideal reference for students, educators, and developers seeking hands-on experience with algorithmic concepts in Python. -
4
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. ... -
Build Data Resilience - Take the Assessment TodayIs 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.
-
5
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... -
6
Arduino FOC
Arduino FOC for BLDC and Stepper motors
We live in very exciting times 😃! BLDC motors are entering the hobby community more and more and many great projects have already emerged leveraging their far superior dynamics and power capabilities. BLDC motors have numerous advantages over regular DC motors but they have one big disadvantage, the complexity of control. Even though it has become relatively easy to design and manufacture PCBs and create our own hardware solutions for driving BLDC motors the proper low-cost solutions are yet to come. ... -
7
VR Paged List for C# and more
VR Paged List for C# and more
a collection of Vincent Radio {Adrix.NT} C# sources & build projects includes - Paged Lists & Iterators Library for C# - Multi Dimensional Array Library for C# - MDArray List Manager Library for C# - Adjacency (List | Matrix) Direct Graph Libs for C# - Range Check functions - VRMosaic (WinForms) - with Auto Resolver also includes - Source Files - Visual Studio Build Projects - Test Applics have fun adrixnt@hotmail.it -
8
VR Paged List GXS for C++ and more ...
Paged Lists & Iterators GXS for C++ Sources by Vincent Radio {Adrix.NT
Vincent Radio {Adrix.NT} presents Paged Lists & Iterators GXS for C++ Sources by Vincent Radio {Adrix.NT} also contains - Little Docs about Paged Lists (docx, pdf) - VR Basic Common Utils Sources (Array List ...) - VR Generic Multi Dim Array Class - VR Generic MDArray List Mgr Class - VR Generic Adjacency (List | Matrix) Direct Graph Classes - VR List Interface with STL Support with some nice implementations (ArrayList, Paged-LIst) - Env Var Notes for sources for C++ Builder (Embarcadero) - Special DLLs Build - Embarcadero C++Builder VCL Test Application for Paged List - Dev-C++, Visual Studio Build Projects have fun another fine SunStorm release for more products write to ... ... -
9
NOTE: The GROOVE codebase has moved to https://github.com/nl-utwente-groove
-
Custom VMs From 1 to 96 vCPUs With 99.95% UptimeLive migration and automatic failover keep workloads online through maintenance. One free e2-micro VM every month.
-
10
javascript-algorithms
JavaScript implementations of computer science algorithms
javascript-algorithms is a repository that implements a comprehensive collection of classic data structures and algorithmic solutions in JavaScript — including sorting, searching, graph algorithms, dynamic programming, and more. It serves as a learning and reference resource for developers wanting to understand how standard algorithms can be expressed in JavaScript, bridging the gap between theoretical algorithm knowledge and practical implementation usable in web or Node.js contexts. Because algorithms are implemented in a language (JavaScript) many developers use daily, the repo becomes especially useful for students, interview-preparation candidates, or anyone wanting to learn algorithmic thinking without switching languages. ... -
11
Java generic API for search algorithms on graphs implicitly given by tree node expansion operator
-
12
Zipline
Zipline, a Pythonic algorithmic trading library
Zipline is a Pythonic algorithmic trading library. It is an event-driven system for backtesting. Zipline is currently used in production as the backtesting and live-trading engine powering Quantopian -- a free, community-centered, hosted platform for building and executing trading strategies. Quantopian also offers a fully managed service for professionals that includes Zipline, Alphalens, Pyfolio, FactSet data, and more. Installing Zipline is slightly more involved than the average Python package. ... -
13
java-string-similarity
Implementation of various string similarity and distance algorithms
...The "cost" column gives an estimation of the computational cost to compute the similarity between two strings of length m and n respectively. If the alphabet is finite, it is possible to use the method of four russians (Arlazarov et al. "On economic construction of the transitive closure of a directed graph", 1970) to speedup computation. This was published by Masek in 1980 ("A Faster Algorithm Computing String Edit Distances"). -
14
TSP Solver and Generator
Generate and solve Travelling Salesman Problem tasks
...The matrix can be populated with random values in a given range (useful for generating tasks). The result is an optimal route, its price, step-by-step matrices of solving and solving graph. The task can be saved in internal binary format and opened later. The result can be printed or saved as PDF, HTML, or ODF. TSPSG may be useful for teachers to generate test tasks or just for regular users to solve TSPs. Also, it may be used as an example of using Branch and Bound method to solve a particular task. -
15
LEAN
Lean algorithmic trading engine by QuantConnect
Automated accounting for splits, dividends, and corporate events like delistings and mergers. Avoid selection bias with dynamically generated assets. Create and select asset universes on proprietary data and indicators. Automatically track portfolio performance, profit and loss, and holdings across multiple asset classes and margin models in the same strategy. Trigger regular functions to occur at desired times, during market hours, on certain days of the week, or at specific times of day.... -
16
Javascript Clipper
Boolean operations and offsetting library in Javascript
...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. ... -
17
JavaGimmicks
Utility classes, APIs and tools for Java
A set of helper and utility classes, APIs and tools for the Java Programming Language. For more details - pleas visit the project homepage. -
18
Algorithms in Python
Data Structures and Algorithms in Python
Algorithms in Python is a collection of algorithm and data structure implementations (primarily in Python) meant to serve as both learning material and reference code for engineers. It includes code for graph algorithms, heap data structures, stacks, queues, and more — each implemented cleanly so learners can trace logic and adapt for their problems. The repository is particularly useful for people preparing for competitive programming, job interviews, or building a foundational understanding of algorithmic patterns. Because it’s openly maintained, you can browse through issues, see test cases, and observe coding style in a “learning through code” fashion. ... -
19
algorithms.js
Classic algorithms and data structures implemented in JavaScript
Traditional Computer Science algorithms and data structures implemented in JavaScript. Algorithms such as collatzConjecture, extendedEuclidean, fastPower, fibonacci, findDivisors, fisherYates, gcd (Greatest common divisor), greatestDifference, lcm (Least common multiple), newtonSqrt, nextPermutation, powerSet, reservoirSampling, shannonEntropy, etc. -
20
HRDAG
Framework for Hierarchical Graph Decomposition
This is a framework used to decompose hierarchical graphs, i.e.,graphs which were created from or contain a hierarchy of modules. Each module is reused several times in the hierarchy. This may be useful to reverse-engineer human constructs like electronic equipment, manufactured machines, or bureaucratic hierarchies; but also to decompose natural constructs like gene-relation or protein-relation nets. -
21
Algorithms & Data Structures in C++
Algorithms & Data structures in C++
...After the program passes correctly, please initiate Pull Requests, the code is verified and stored in the library, and the new algorithm implementation is published in the README. TAB = 4 space. set ts=4 in vim. Graph output format is Graphviz Dot format. (the output format of the graph is in dot of graphviz.) -
22
Graphal
Graph algorithms interpreter, IDE, debugger, 3D visualizations.
Graphal is an interpreter of a programming language that is mainly oriented to graph algorithms. There is a command line interpreter and a graphical integrated development environment. The IDE contains text editor for programmers, compilation and script output, advanced debugger and visualization window. The progress of the interpreted and debugged graph algorithm can be displayed in 3D scene. -
23
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. -
24
Approximate Subgraph Matching Algorithm
Approximate Subgraph Matching Algorithm for Dependency Graphs
...We further designed an approximate subgraph matching (ASM) algorithm that is capable of detecting approximate subgraph matching based on a subgraph distance. Assume that the graph G and the subgraph Gs have m and n vertices, and km and kn edges respectively, the total worst-case algorithm complexity is O(m^n * n(n-1)/2 * km * log m). This Java implementation implements our ASM algorithm. See README file: https://sourceforge.net/projects/asmalgorithm/files/ If you use our ASM implementation to support academic research, please cite the following paper: Haibin Liu, Lawrence Hunter, Vlado Keselj, and Karin Verspoor. ... -
25
Asteroid
A CBLS Engine in SCALA, NOW part of OscaR
Asteroid has been merged with Scampi, to give rise to OScar. Follow us on https://bitbucket.org/oscarlib/oscar/wiki/Home Asteroid offers a powerful framework for developing constraint-based local search solution to combinatorial problems. This technique provides good scalability to real-world problems. It includes a library of standard constraints and invariants to declaratively define the problem you want to solve, and it also provides powerful search mechanisms.