Search Results for "live-graph"
Sort By:
Showing 17 open source projects for "live-graph"
View related business solutions-
MongoDB Atlas runs apps anywhereMongoDB Atlas gives you the freedom to build and run modern applications anywhere—across AWS, Azure, and Google Cloud. With global availability in over 115 regions, Atlas lets you deploy close to your users, meet compliance needs, and scale with confidence across any geography.
-
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
rofi-calc
Do live calculations in rofi
rofi-calc is a calculator plugin that brings live mathematical evaluation into the Rofi application launcher. It sends natural-language expressions to Qalculate’s qalc engine and displays the result while the user types. Queries can include arithmetic, percentages, unit and currency conversions, number-base conversions, and linear equations. Results or history entries can be selected, printed, copied, typed into another application, or passed to a custom shell command. -
2
slgraph
a graph format and library for sublinear graph algorithms
slgraph consists of graph formats suitable for sublinear-time graph algorithms and libraries for reading and writing these formats. -
3
rw
rw calculates rank-width and rank-decompositions.
...It is based on ideas from "Computing rank-width exactly" by Sang-il Oum, "Sopra una formula numerica" by Ernesto Pascal, "Generation of a Vector from the Lexicographical Index" by B.P. Buckles and M. Lybanon and "Fast additions on masked integers" by Michael D. Adams and David S. Wise. On 2009's computers it works quite well up to graph sizes of about 28 nodes. Runtime and memory usage are exponential in the graph size. -
4
zshg
constant-time graph connectivity test
zshg is an implementation of a constant-time connectivity test for graphs. It is based on "Property Testing in Bounded Degree Graphs" by Oded Goldreich and Dana Ron, "Algorithmic and Analysis Techniques in Property Testing" by Dana Ron. -
$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.
-
5
GenReg
Generation of regular graphs
Efficient, complete and non-redundant generation of regular graphs as described in M. Meringer: Fast Generation of Regular Graphs and Construction of Cages. Journal of Graph Theory 30, 137-146, 1999. -
6
lnlc
lnlc calculates linear nlc-width and corresponding expressions
lnlc calculates linear nlc-width and corresponding linear nlc-width expressions. On 2014's computers it works quite well up to graph sizes of about 10 nodes of linear nlc-width 3. The runtime depends on the size of the input graph, its linear nlc-width, and the number of nodes of high degree. The archive also contains the widths and corresponding expressions for the trees of up to 12 nodes. -
7
Functy
Functy is a 3D graph drawing package that generates immediate results.
Note: The Functy and libsymbolic code has now moved to GitLab: https://gitlab.com/flypig/functy https://gitlab.com/flypig/libsymbolic This project has been left here for archival purposes. Functy is a 3D graph drawing package. It allows Cartesian, spherical and parametric curve functions to be plotted and altered quickly and easily. This immediacy and the vivid results promote fun exploration of 3D function. Rendering is performed entirely on the GPU to improve visuals and performance. Ubuntu functy PPA: https://launchpad.net/~flypig/+archive/ubuntu/ppa -
8
quickplot
interactive 2D plotter
Quickplot is a fast interactive 2D plotter with infinite zooming, value picking, pipe input, and unlimited plots displayed. Quickplot is meant for looking at your data quickly and of secondary importance is making static pictures of your data. -
9
hbgm
'Hierarchical Bond Graph Modelling of Biochemical Networks'
Scripts and supplementary data for the manuscript 'Hierarchical Bond Graph Modelling of Biochemical Networks': Peter J. Gawthrop(1), Joseph Cursons(1,2), and Edmund J. Crampin(1-4). (1) Systems Biology Laboratory, Melbourne School of Engineering, University of Melbourne, Victoria 3010, Australia. (2) ARC Centre of Excellence in Convergent Bio-Nano Science, Melbourne School of Engineering, University of Melbourne, Victoria 3010, Australia -
Build Agents and Models on One PlatformGemini 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.
-
10
mapgraph
Massively Parallel Graph processing on GPUs -- now part of Blazegraph
Mapgraph is SYSTAP’s disruptive new technology to exploit the main memory bandwidth advantages of GPUs. The early work was co-developed with the University of Utah SCI Institute and has its pedigree in the UINTAH software running on over 750M cores on the TITAN Super Computer. Today, SYSTAP has commercialized this technology into it’s Blazegraph Accelerator and Blazegraph HPC products. Checkout our options for GPU acceleration of graphs or contact us to learn more: ... -
11
Trad4 is a fully concurrent, thread safe, graph-based programming language that scales linearly on multiple cores. It is initially intended for deployment in the financial industry to model real-time risk.
-
12
Parallelized (threaded) software to enumerate all maximal subgraphs of a graph that exceed a specified density, even if they overlap.
-
13
gnf3d is a small 3D engine written in C(gtk+).It has fantastic super 3D effect since it use two graph for different eye.
-
14
A set of small utilities realizing theoretical graph algorithms (including tree algorithms). The utilities work with simple text input/output formats.
-
15
Graph (Set of Vertices and Edges) Editor and Analyser. Can test new "algorithms" on graphs using this software. Done as a 6th Sem CSE, BE Project.
-
16
-
17
The Graph Implementation and Representation Libraries, or GIRLs, aim to be all-purpose libraries for solving graph theory problems. ie, shortest paths, matching, cycles, connectedness, creating 'random' graphs, etc...
- Previous
- You're on page 1
- Next