Search Results for "graph visualization"
Sort By:
Showing 16 open source projects for "graph visualization"
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.
-
Error to trace to log to deploy. One click. No SSH.AppSignal links every error to the trace, the trace to the log, the log to the deploy that shipped it.
-
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
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. -
3
MolecularGraph.jl
Graph-based molecule modeling toolkit for cheminformatics
MolecularGraph.jl is a graph-based molecule modeling and chemoinformatics analysis toolkit fully implemented in Julia. -
4
SuiteSparseGraphBLAS.jl
Sparse, General Linear Algebra for Graphs
A fast, general sparse linear algebra and graph computation package, based on SuiteSparse:GraphBLAS. -
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.
-
5
ReactiveMP.jl
High-performance reactive message-passing based Bayesian engine
ReactiveMP.jl is a Julia package that provides an efficient reactive message passing based Bayesian inference engine on a factor graph. The package is a part of the bigger and user-friendly ecosystem for automatic Bayesian inference called RxInfer. While ReactiveMP.jl exports only the inference engine, RxInfer provides convenient tools for model and inference constraints specification as well as routines for running efficient inference both for static and real-time datasets. -
6
InferOpt.jl
Combinatorial optimization layers for machine learning pipelines
InferOpt.jl is a toolbox for using combinatorial optimization algorithms within machine learning pipelines. It allows you to create differentiable layers from optimization oracles that do not have meaningful derivatives. Typical examples include mixed integer linear programs or graph algorithms. -
7
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... -
8
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. -
9
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. -
Compliant and Reliable File Transfers Backed by Top Security CertificationsStop relying on non-certified, legacy file transfer tools that creak under the weight of modern security demands. Get full audit trails, advanced access controls and more supported by an award-winning team of experts. Start your free 25-day trial today.
-
10
Circuitscape.jl
Algorithms from circuit theory to predict connectivity
Circuitscape is an open-source program that uses circuit theory to model connectivity in heterogeneous landscapes. Its most common applications include modeling the movement and gene flow of plants and animals, as well as identifying areas important for connectivity conservation. The new Circuitscape is built entirely in the Julia language, a new programming language for technical computing. Julia is built from the ground up to be fast. As such, this offers a number of advantages over the... -
11
PDMats.jl
Uniform Interface for positive definite matrices of various structures
Uniform interface for positive definite matrices of various structures. Positive definite matrices are widely used in machine learning and probabilistic modeling, especially in applications related to graph analysis and Gaussian models. It is not uncommon that positive definite matrices used in practice have special structures (e.g. diagonal), which can be exploited to accelerate computation. PDMats.jl supports efficient computation on positive definite matrices of various structures. In... -
12
DynamicHMC
Implementation of robust dynamic Hamiltonian Monte Carlo methods
Implementation of robust dynamic Hamiltonian Monte Carlo methods in Julia. In contrast to frameworks that utilize a directed acyclic graph to build a posterior for a Bayesian model from small components, this package requires that you code a log-density function of the posterior in Julia. Derivatives can be provided manually, or using automatic differentiation. Consequently, this package requires that the user is comfortable with the basics of the theory of Bayesian inference, to the extent... -
13
Optimization.jl
Mathematical Optimization in Julia
Optimization.jl provides the easiest way to create an optimization problem and solve it. It enables rapid prototyping and experimentation with minimal syntax overhead by providing a uniform interface to >25 optimization libraries, hence 100+ optimization solvers encompassing almost all classes of optimization algorithms such as global, mixed-integer, non-convex, second-order local, constrained, etc. It allows you to choose an Automatic Differentiation (AD) backend by simply passing an... -
14
NeuralOperators.jl
DeepONets, Neural Operators, Physics-Informed Neural Ops in Julia
Neural operator is a novel deep learning architecture. It learns an operator, which is a mapping between infinite-dimensional function spaces. It can be used to resolve partial differential equations (PDE). Instead of solving by finite element method, a PDE problem can be resolved by training a neural network to learn an operator mapping from infinite-dimensional space (u, t) to infinite-dimensional space f(u, t). Neural operator learns a continuous function between two continuous function... -
15
Semagrams.jl
A graphical editor for graph-like structures
A graphical editor for graph-like structures based on Catlab. Legacy version built with typescript is in the legacy branch, and will not receive updates; new version with scala is now in the main branch. The core of Semagrams is just a library; in order to make it do things, one needs to create an "app" that uses it. Currently, the only app that is being developed is a Petri net editor, though this will soon change. In order to run the Petri net editor standalone, install Mill and npm, and... -
16
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. It is an explicit design...
- Previous
- You're on page 1
- Next
