Search Results for "graphs"
Sort By:
Showing 9 open source projects for "graphs"
View related business solutions-
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.
-
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.
-
1
Graphs.jl
An optimized graphs package for the Julia programming language
The goal of Graphs.jl is to offer a performant platform for network and graph analysis in Julia, following the example of libraries such as NetworkX in Python. Offers a set of simple, concrete graph implementations – SimpleGraph (for undirected graphs) and SimpleDiGraph (for directed graphs), an API for the development of more sophisticated graph implementations under the AbstractGraph type, and a large collection of graph algorithms with the same requirements as this API. -
2
MultilayerGraphs.jl
Julia package for the creation and analysis of multilayer graphs
MultilayerGraphs.jl is a Julia package for the creation, manipulation and analysis of the structure, dynamics and functions of multilayer graphs. A multilayer graph is a graph consisting of multiple standard subgraphs called layers which can be interconnected through bipartite graphs called interlayers composed of the vertex sets of two different layers and the edges between them. The vertices in each layer represent a single set of nodes, although not all nodes have to be represented in every layer. -
3
GraphNeuralNetworks.jl
Graph Neural Networks in Julia
GraphNeuralNetworks.jl is a graph neural network library written in Julia and based on the deep learning framework Flux.jl. -
4
ONNX.jl
Read ONNX graphs in Julia
ONNX.jl is in the process of a total reconstruction and currently supports saving & loading graphs as a Umlaut.Tape. When possible, functions from NNlib or the standard library are used, but no conversion to Flux is implemented yet. See resnet18.jl for a practical example of graph loading. -
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.
-
5
SuiteSparseGraphBLAS.jl
Sparse, General Linear Algebra for Graphs
A fast, general sparse linear algebra and graph computation package, based on SuiteSparse:GraphBLAS. -
6
QuantumClifford.jl
Clifford circuits, graph states, and other quantum Stabilizer tools
A Julia package for working with quantum stabilizer states and Clifford circuits that act on them. Graphs states are also supported. The package is already very fast for the majority of common operations, but there are still many low-hanging fruits performance-wise. See the detailed suggested readings & references page for background on the various algorithms. -
7
Catalyst.jl
Chemical reaction network and systems biology interface
Catalyst.jl is a symbolic modeling package for analysis and high-performance simulation of chemical reaction networks. Catalyst defines symbolic ReactionSystems, which can be created programmatically or easily specified using Catalyst's domain-specific language (DSL). Leveraging ModelingToolkit and Symbolics.jl, Catalyst enables large-scale simulations through auto-vectorization and parallelism. Symbolic ReactionSystems can be used to generate ModelingToolkit-based models, allowing the easy... -
8
ProbabilisticCircuits.jl
Probabilistic Circuits from the Juice library
This module provides a Julia implementation of Probabilistic Circuits (PCs), tools to learn structure and parameters of PCs from data, and tools to do tractable exact inference with them. Probabilistic Circuits provides a unifying framework for several family of tractable probabilistic models. PCs are represented as computational graphs that define a joint probability distribution as recursive mixtures (sum units) and factorizations (product units) of simpler distributions (input units). Given certain structural properties, PCs enable different range of tractable exact probabilistic queries such as computing marginals, conditionals, maximum a posteriori (MAP), and more advanced probabilistic queries. -
9
LightGraphs
An optimized graphs package for the Julia programming language
LightGraphs offers both (a) a set of simple, concrete graph implementations -- Graph (for undirected graphs) and DiGraph (for directed graphs), and (b) an API for the development of more sophisticated graph implementations under the AbstractGraph type. The project goal is to mirror the functionality of robust network and graph analysis libraries such as NetworkX while being simpler to use and more efficient than existing Julian graph libraries such as Graphs.jl. -
Our Free Plans just got better! | Auth0You asked, we delivered! Auth0 is excited to expand our Free and Paid plans to include more options so you can focus on building, deploying, and scaling applications without having to worry about your security. Auth0 now, thank yourself later.
- Previous
- You're on page 1
- Next
