Search Results for "node graph" - Page 3
Sort By:
Showing 80 open source projects for "node graph"
View related business solutions-
$300 in Free Credit Towards Top Cloud ServicesStart your project in minutes. After credits run out, 20+ products include free monthly usage. Only pay when you're ready to scale.
-
Forever Free Full-Stack Observability | Grafana CloudBuilt on open standards like Prometheus and OpenTelemetry, Grafana Cloud includes Kubernetes Monitoring, Application Observability, Incident Response, plus the AI-powered Grafana Assistant. Get started with our generous free tier today.
-
1
SINGA
A distributed deep learning platform
...Various example deep learning models are provided in SINGA repo on Github and on Google Colab. SINGA supports data parallel training across multiple GPUs (on a single node or across different nodes). SINGA supports various popular optimizers including stochastic gradient descent with momentum, Adam, RMSProp, and AdaGrad, etc. SINGA records the computation graph and applies the backward propagation automatically after forward propagation. The optimization of memory are implemented in the Device class. ... -
2
Graph Nets library
Build Graph Nets in Tensorflow
...This library implements the foundational ideas from DeepMind’s paper “Relational Inductive Biases, Deep Learning, and Graph Networks”, offering tools to explore relational reasoning and message-passing neural networks. Graph Nets supports both TensorFlow 1 and TensorFlow 2, working with CPU and GPU environments, and includes educational Jupyter demos for shortest path finding, sorting, and physical prediction tasks. The codebase emphasizes modularity, allowing users to easily define their own edge, node, and global update functions. -
3
Rickshaw
JavaScript toolkit for creating interactive real-time graphs
Rickshaw provides the elements you need to create interactive graphs, renderers, legends, hovers, range selectors, etc. You put the pieces together. It's all based on d3 underneath, so graphs are drawn with standard SVG and styled with CSS. Customize all you like with techniques you already know. Rickshaw is free and open source, available under the MIT license. Developed at Shutterstock. Rickshaw relies on the fantastic D3 visualization library to do lots of the heavy lifting for stacking... -
4
VivaGraph
Graph drawing library for JavaScript
VivaGraphJS is a powerful, high-performance graph drawing library for JavaScript that enables developers to visualize complex networks directly in the browser or in Node.js environments. It is designed for speed and scalability, handling large graph datasets with smooth rendering and interactive capabilities such as dragging nodes and zooming. The library supports multiple rendering backends including SVG, WebGL, and Canvas, allowing developers to choose the best balance of performance and... -
Gemini 3 and 200+ AI Models on One PlatformBuild, govern, and optimize agents and models with Gemini Enterprise Agent Platform.
-
5
nodejs-dashboard
Telemetry dashboard for node.js apps from the terminal
nodejs-dashboard is a terminal-based telemetry dashboard that provides real-time insight into Node.js application behavior during development. It overlays an interactive monitoring interface on top of a running Node process, displaying metrics such as event loop activity, memory usage, and request throughput. The tool can be injected into applications with minimal or no code changes by using Node’s preload flag, making adoption straightforward for developers. Its interface uses Unicode... -
6
Imogen
GPU Texture Generator
Imogen is a real-time, node-based procedural texture generation tool aimed at artists, developers, and shader enthusiasts. It allows users to build complex material textures using a graph-based interface, combining operations like blending, noise, filters, and color correction in a non-destructive workflow. Built with Vulkan and ImGui, Imogen provides immediate visual feedback and supports GPU acceleration for high-resolution texture output. -
7
GUN
Cybersecurity protocol for syncing decentralized graph data
GUN is a small, easy, and fast data sync and storage system that runs everywhere JavaScript does. The aim of GUN is to let you focus on the data that needs to be stored, loaded, and shared in your app without worrying about servers, network calls, databases, or tracking offline changes or concurrency conflicts. This lets you build cool apps fast. When a browser peer asks for data, it'll merge the reply with its own data using a CRDT, then cache the result. GUN is fully decentralized... -
8
Gekko
A bitcoin trading bot written in node
Gekko is an open source platform for automating trading strategies over bitcoin markets. Define your own trading strategy and Gekko will take care of everything else. Gekko is free and 100% open source, you download and run the software on your own machine. Gekko only talks to the exchanges (if you want it too). We don't know anyhing about your strategies, usage, portfolio size or anything else (unless you tell us). Gekko supports 16 different exchanges (including Bitfinex, Bitstamp and... -
9
Easy Machine Learning
Easy Machine Learning is a general-purpose dataflow-based system
...Our platform Easy Machine Learning presents a general-purpose dataflow-based system for easing the process of applying machine learning algorithms to real-world tasks. In the system, a learning task is formulated as a directed acyclic graph (DAG) in which each node represents an operation (e.g. a machine learning algorithm), and each edge represents the flow of the data from one node to its descendants. -
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
elasticsearch-head
A web front end for an elastic search cluster
elasticsearch-head is a web front end for browsing and interacting with an Elastic Search cluster. elasticsearch-head is hosted and can be downloaded or forked at github. There are two ways of running and installing elasticsearch-head. Running as a plugin of ElasticSearch (this is the preferred method). And running as a standalone webapp. By default es-head will immediately attempt to connect to a cluster node at http://localhost:9200/. Enter a different node address in the connect box and... -
11
vizceral
WebGL visualization for displaying animated traffic graphs
vizceral is a component for displaying traffic data on a webgl canvas. If a graph of nodes and edges with data about traffic volume is provided, it will render a traffic graph animating the connection volume between nodes. This component can take multiple traffic graphs and will generate a 'global' graph showing all incoming traffic into each of the 'regions', with support for cross-region traffic. There are three levels of information, global, regional, and service-level, with clicking or double-clicking on a node bringing you one level deeper. ... -
12
node2vec
Learn continuous vector embeddings for nodes in a graph using biased R
The node2vec project provides an implementation of the node2vec algorithm, a scalable feature learning method for networks. The algorithm is designed to learn continuous vector representations of nodes in a graph by simulating biased random walks and applying skip-gram models from natural language processing. These embeddings capture community structure as well as structural equivalence, enabling machine learning on graphs for tasks such as classification, clustering, and link prediction.... -
13
Hetionet
Hetionet: an integrative network of disease
Hetionet is a hetnet — network with multiple node and edge (relationship) types — which encodes biology. The hetnet was designed for Project Rephetio, which aims to systematically identify why drugs work and predict new therapies for drugs. The JSON and Neo4j formats contain node and edge properties, which are absent in the TSV and matrix formats, including licensing information. -
14
The min cost is a program which is going to find the minimum cost or path of any given numbers. if you have a certain set of numbers this program is going to calculate the optimized cost for that set. Similarly, the program can perform Dijkstra's algorithm which is an algorithm for finding the shortest paths between nodes in a graph by simply insert the node distance in the input file and output the shortest path in output file. The program was written in C++ using a main algorithm of a heap sorting. In this program, specifically users the codes for minimum heap since the purpose of the program is to find the minimum cost or path.
-
15
Toolkit for exporting/importing Maya scenes to/from OpenSceneGraph
-
16
SOAPdenovo2
Large-size genome de-novo assembler
What's next of SOAPdenovo2: MEGAHIT is the formal successor of SOAPdenovo2 MEGAHIT: An ultra-fast single-node solution for large and complex metagenomics assembly via succinct de Bruijn graph http://www.ncbi.nlm.nih.gov/pubmed/25609793 https://github.com/voutcn/megahit Latest Code on GitHub: https://github.com/aquaskyline/SOAPdenovo2 SOAPdenovo is a novel short-read assembly method that can build a de novo draft assembly for human-sized genomes. -
17
Graphlet kernel framework
Calculates similarity between neighborhoods of two vertices in a graph
This software package provides a framework for calculating similarity between neighborhoods rooted at two vertices of interest in a labeled graph (undirected or directed). The list of available similarity functions includes: cumulative random walk, standard random walk, standard graphlet kernel, edit distance graphlet kernel, label substitution graphlet kernel and edge indel graphlet kernel. The graphlet kernel framework can be used for vertex (node) classification in graphs, kernel-based clustering, or community detection. ... -
18
reco4j-neo4j
Reco4j is a graph-based recommendation engine, this is the neo4j impl
...Reco4j can be used on every graph where "user" and "item" is represented by node and the preferences are modelled as relationship between them. Current implementation leverage on Neo4j as first graph database integrated in our framework. -
19
reco4j-core
Reco4j is a graph-based recommendation engine
...Reco4j can be used on every graph where "user" and "item" is represented by node and the preferences are modelled as relationship between them. Current implementation leverage on Neo4j as first graph database integrated in our framework. -
20
EarTeach desktop Ear Trainer
Complete Musical Ear Training HTML5 application.
This EarTeach client is the desktop distribution, of the homonymous HTML5 open source online application www.earteach.com, packed with node-webkit. EarTeach features the following groups of trainers. - Chords - Intervals - Scales Each category has a set of prebuild exercises, and user can create and save, its own customized exercise presets. All user results are stored, allowing to evaluate the current musical skills status, in each preset, or even display a graph of the progress along the time. -
21
Intelligent Water Drops Algorithm
Solving optimization problems by the Intelligent Water Drops algorithm
...It tries to imitate the behavior that natural water drops conduct in river beds where they create complex paths that seem optimistic considering the environment, obstacles, and the surrounding terrain. One way to use the IWD algorithm is to map our optimization problem into a graph over which Intelligent Water Drops (IWDs) travel from node to node to gradually create complete solutions. During this trip, the soli of the graph deposited on the links of the graph are changed and little by little the optimal paths will hold less soil in comparison to other possible paths. It is also possible to solve continuous optimization problems by the IWD algorithm. ... -
22
A plugin for the Eclipse IDE to generate control flow graphs and show coverage information. Supports node, edge, edge-pair and prime path coverage. Based on the Eclipse Control Flow Graph Generator (http://eclipsefcg.sourceforge.net/)
-
23
-
24
A project to create of open source routing engine for navigation and possibly other graph analysis. Our goal is to build a commercial grade routing engine capable of find routes through 25-30 million node networks in 1 second ball park times.
-
25
GHIRL is the Graph-based Heterogeneous Information Representation Language: a java library for representing, querying, and navigating graph- or network-based data structures.
