Search Results for "squid-graph"
Sort By:
Showing 116 open source projects for "squid-graph"
View related business solutions-
Ship Agents FasterGemini Enterprise Agent Platform lets you rapidly build, scale, govern and optimize production-ready agents grounded in your organization's data. The platform enables developers to build custom or pre-built agents for virtually any use case. New customers get $300 in free credits.
-
Stop vibe-debugging.AppSignal's MCP server hands Claude, Cursor, or Zed your real errors, traces, and the deploy that shipped them. AI writes the fix; you review the diff.
-
1
Algebraic graphs
Algebraic graphs
...See this Haskell Symposium paper and the corresponding talk for the motivation behind the library, the underlying theory and implementation details. We can give semantics to the constructors in terms of the pair (V, E) of graph vertices and edges. Alga can handle graphs comprising millions of vertices and billions of edges in a matter of seconds, which is fast enough for many applications. We believe there is a lot of potential for improving the performance of the library, and this is one of our top priorities. If you come across a performance issue when using the library, please let us know. -
2
SuiteSparseGraphBLAS.jl
Sparse, General Linear Algebra for Graphs
A fast, general sparse linear algebra and graph computation package, based on SuiteSparse:GraphBLAS. -
3
PyTensor
Python library for defining and optimizing mathematical expressions
...PyTensor is based on Theano, which has been powering large-scale computationally intensive scientific investigations since 2007. A hackable, pure-Python codebase. Extensible graph framework is suitable for rapid development of custom operators and symbolic optimizations. Implements an extensible graph transpilation framework that currently provides compilation via C, JAX, and Numba. Based on one of the most widely-used Python tensor libraries: Theano. -
4
OR-Tools - Google Optimization Tools
Google's software suite for combinatorial optimization
Google Optimization Tools, also known as OR-Tools is an open-source, fast and portable software suite for solving combinatorial optimization problems. These encompass problems in vehicle routing, flows, integer and linear programming, and constraint programming. This suite contains a number of solvers, namely: a constraint programming solver; a linear programming solver; wrappers for commercial solvers (like Gurobi or CPLEX) and other open source solvers (SCIP, GLPK, etc.); among others.... -
Enterprise-grade ITSM, for every businessFreshservice is an intuitive, AI-powered platform that helps IT, operations, and business teams deliver exceptional service without the usual complexity. Automate repetitive tasks, resolve issues faster, and provide seamless support across the organization. From managing incidents and assets to driving smarter decisions, Freshservice makes it easy to stay efficient and scale with confidence.
-
5
PyTorch Geometric
Geometric deep learning extension library for PyTorch
It consists of various methods for deep learning on graphs and other irregular structures, also known as geometric deep learning, from a variety of published papers. In addition, it consists of an easy-to-use mini-batch loader for many small and single giant graphs, a large number of common benchmark datasets (based on simple interfaces to create your own), and helpful transforms, both for learning on arbitrary graphs as well as on 3D meshes or point clouds. We have outsourced a lot of... -
6
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. -
7
JGraphT is a free Java class library that provides mathematical graph-theory objects and algorithms. JGraphT supports a rich gallery of graphs and is designed to be powerful, extensible, and easy to use.
-
8
JPlotter
Plotter for math functions y=f(x)
...Some of the special features are plotting of the derivatives, area calculation, plotting of directional fields of differential equations and plotting of phase and amplitude graph of complex functions. -
9
Advanced Trigonometry Calculator
Precision Trigonometry: Advanced Calculator for Complex Math
Advanced Trigonometry Calculator is equipped with a user-friendly interface that allows for easy input of problems and instant computation. Professionals such as engineers who need to perform advanced trigonometric calculations in their work will find this tool extremely useful. ATC Online Alpha: https://advantrigoncalc.sourceforge.io/atc/ More info by clicking below: https://advantrigoncalc.sourceforge.io/ Advanced Trigonometry Calculator was only and always only developed by... -
$300 Free Credits for Your Google Cloud ProjectsLaunch your next project with $300 in free Google Cloud credits—no strings attached. Test, build, and deploy without risk. Use your credits across the entire Google Cloud platform to find what works best for your needs. After your credits are used, continue with always-free tier services. Only pay when you're ready to scale. Sign up in minutes and start exploring.
-
10
Social Network Visualizer
Social Network Analysis and Visualization software
Visit our new site: http://socnetv.org Social Network Visualizer (SocNetV) is a social network analysis and visualization application. You can draw a social network (graph/digraph) or load an existing one (GraphML, UCINET, Pajek, etc), compute cohesion, centrality, community and structural equivalence metrics and apply various layout algorithms based on actor centrality or prestige scores (i.e. Eigenvector, Betweenness) or on dynamic models (i.e. Kamada-Kawai spring-embedder) -
11
RootGraph
Graphic interface with algorithms to compute line and root graphs
Simple and intuitive graphic interface for graph theory with algorithms to compute line and root graphs of a given graph. - Double click to add a new node. - Left click a node and drag to change the position of the node. - Select a node with left click and add an edge with the next node you select. - Right click a node to delete it. Made in C++ using the wxWidgets library. -
12
Symja Java Computer Algebra
Symja - Java computer algebra language & symbolic math library
Symja - computer algebra language and Java symbolic math library. Moved to https://github.com/axkr/symja_android_library. The Android App can be found at: https://github.com/axkr/symja-example -
13
Algorithms Math Models
MATLAB implementations of algorithms
...The repository gathers implementations and case studies across many topics commonly used in contest solutions: optimization (linear, integer, goal and nonlinear programming), heuristic and metaheuristic methods (simulated annealing, genetic algorithms, immune algorithms), neural networks and time-series methods, interpolation and regression, graph theory, cellular automata, grey systems, fuzzy models, partial/ordinary differential equations, and multivariate analysis, among others. The codebase is organized into topic folders (e.g., HeuristicAlgorithm, IntegerProgramming, NeuralNetwork, TimeSeries) and includes dozens of worked examples and links to textbook/source materials that the author used to assemble the collection. -
14
Notepad++ GraphBuilder plugin
Building math graphs in notepad++
...Please note that the plugin is intended for 32-bit version of Notepad++ only. The "deriv" function is implemented. For example, the following formula: deriv ("sin x", "x", 0.01) draws derivative of "sin x" function graph using "x" as x variable. Third parameter is optional and specifies the accuracy. The latest version is powered by high-precision mode which makes calculation the overlaps much more accurate. Polar coordinate system max angle is now adjustable. The plugin builds any number of math graphs, locates its intersections and extremes, makes the report. ... -
15
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. -
16
Graph is a program used for drawing graphs of mathematical functions. It is easy to use while having a lot of features and settings. Official web site is located at http://www.padowan.dk
-
17
pgfplots - A TeX package to draw normal and/or logarithmic plots directly in TeX in two and three dimensions with a user-friendly interface and pgfplotstable - a TeX package to round and format numerical tables. Examples in manuals and/or on web site. ATTENTION: As of February 2020, the development has been moved to https://github.com/pgf-tikz/pgfplots ! Please refer to the new page for downloads and change requests! This page is kept in read-only mode.
-
18
Gato (Graph Animation Toolbox): Animate graph algorithms for example for computing shortest paths, minimal spanning trees, maximum flows or maximal cardinality or weight matchings. Create your own animations using the Animated Data Structures (ADS).
-
19
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. -
20
Pigale is a graph editor and a C++ algorithm library essentially concerned with planar graphs. This software, particularly intended for graph theoretical research, includes new algorithms based on our recent theoretical researches.
-
21
kpolynomeV2
A Qt program that calculates polynoms based on given data coordinates.
Qt 5.9 reimplementation of kpolynome - no KDE required. -
22
lottie vectors
Create, display and process 2D vectors in a 3D window.
Lottie Vectors is an application for Matlab that alows you to do some pretty neat things -with vectors. More exactly -displaying them in ways that hopefully will allow you to explore and better understand your vector data. The basic idea is simple, take a vector defined in one of a few different types of data formats and map it on the screen. Add another vector and you start to form a 'route'. Each route or position vector can be accompanied with a 'force' vector. This can be used to... -
23
Root Phenotyping Suite
Three different software tools for phenotyping plant root images
...The software provides a robust, efficient and accurate means of phenotyping of roots, by detecting individual root tips and classifying them as belonging to a primary or lateral root. RootGraph is a novel, fully automated and robust approach for the detailed characterization of root traits, based on a graph optimization process. The scheme, firstly, distinguishes primary roots from lateral roots and, secondly, quantifies a broad spectrum of root traits. -
24
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. -
25
popt4jlib
Parallel Optimization Library for Java
...Implements a number of meta-heuristic algorithms for Non-Linear Programming, including Genetic Algorithms, Differential Evolution, Evolutionary Algorithms, Simulated Annealing, Particle Swarm Optimization, Firefly Algorithm, Monte-Carlo Search, Local Search algorithms, Gradient-Descent-based algorithms, as well as some well-known network flow and other graph algorithms. A fast parallel implementation of the network simplex method, and some full-fledged parallel/distributed MIP solvers will be added in the next version. In general, emphasis is given in improving the efficiency of the algorithms in shared-memory models via java threads, since multi-core machines are so wide-spread today.
