Search Results for "graph algorithms"
Sort By:
Showing 28 open source projects for "graph algorithms"
View related business solutions-
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.
-
Build Securely on AWS with Proven FrameworksMoving to the cloud brings new challenges. How can you manage a larger attack surface while ensuring great network performance? Turn to Fortinet’s Tested Reference Architectures, blueprints for designing and securing cloud environments built by cybersecurity experts. Learn more and explore use cases in this white paper.
-
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
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. -
3
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 particular, it provides uniform interfaces to use positive definite matrices of various structures for writing generic algorithms, while ensuring that the most efficient implementation is used in actual computation. -
4
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. -
Secure File Transfer for Windows with Cerberus by RedwoodCerberus supports unlimited users and connections on a single IP, with built-in encryption, 2FA, and a browser-based web client — all deployable in under 15 minutes with a 25-day free trial.
-
5
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... -
6
Optimization.jl
Mathematical Optimization in Julia
...Additionally, Optimization.jl takes care of passing problem-specific information to solvers that can leverage it such as the sparsity pattern of the hessian or constraint jacobian and the expression graph. -
7
Luigi
Python module that helps you build complex pipelines of batch jobs
Luigi is a Python (3.6, 3.7, 3.8, 3.9 tested) package that helps you build complex pipelines of batch jobs. It handles dependency resolution, workflow management, visualization, handling failures, command line integration, and much more. The purpose of Luigi is to address all the plumbing typically associated with long-running batch processes. You want to chain many tasks, automate them, and failures will happen. These tasks can be anything, but are typically long running things like Hadoop... -
8
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) -
9
StellarGraph
Machine Learning on Graphs
StellarGraph is a Python library for machine learning on graphs and networks. The StellarGraph library offers state-of-the-art algorithms for graph machine learning, making it easy to discover patterns and answer questions about graph-structured data. It can solve many machine learning tasks. Graph-structured data represent entities as nodes (or vertices) and relationships between them as edges (or links), and can include data associated with either as attributes. ... -
AI-powered service management for IT and enterprise teamsGive your IT, operations, and business teams the ability to deliver exceptional services—without the complexity. Maximize operational efficiency with refreshingly simple, AI-powered Freshservice.
-
10
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.
-
11
EntOpt Layout
Relative entropy optimization network layout plugin
The goal of this project is to implement a graph layout / network visualization algorithm as a Java plugin for Cytoscape (http://cytoscape.org/), using a recently published relative entropy optimization based method, called Unified Data Representation (Kovács IA et al. Sci Rep. 2015). If you are using the plugin, please cite: Ágg B, Császár A, Szalay-Bekő M, Veres DV, Mizsei R, Ferdinandy P, Csermely P and Kovács IA (2019) The EntOptLayout Cytoscape plug-in for the efficient visualization... -
12
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... -
13
Peklo is a graph editor and an environment for visualizing and comparing different algorithms for some graph-theoretic problems, e.g. flows, shortest path, minimum spanning tree.
-
14
MuLaViTo
A framework for the visualization of multi-layer networks
MuLaViTo is a multi-layer visualization framework which allows to visualize relations between multiple graphs in derived applications. Moreover, it provides helpful means like k-shortest path algorithms, running algorithms in a separate thread, ... -
15
GraphLayout is a utility to draw large graphs (up to 5000 nodes). It allows you to experiment with different cost functions and algorithms. It also has an external utility which needs to measure the graph quality or its topological features.
-
16
A library including the whole bunch of standard algorithms in graph optimization and drawing. On top of this, a GUI for manipulating and editing of graphs.
-
17
GrALoG is a tool for editing and visualising graph-like-structures and the results of algorithms running on them. Through it's plugins GrALoG is hugely extendable, i.e. plugin-developers can define their own graph-like structures and algorithms.
-
18
-
19
callgraph is a project that provides an algorithm for an optimal vertex positioning of any connected graph in 3D, as well as the library and sample application for viewing graphs in 3D.
-
20
OntoViz, an ontology browser is an extension of my undergraduate honors thesis. This helps a user browse ontologies using a variety of graph drawing algorithms. The ontology can be specified using a text file, a local/remote database or a web service.
-
21
-
22
Graph handling and layout software developed for helping scientific research. The interface uses Perl, the algorithms are in C++. Creates and shows 3D and 2D graph layouts (several algorithms). Has a scripting interface for graph handling.
-
23
A Java software for 3D visualization of graphs/networks. It implements many graph layout algorithms (such as force-directed methods), graph generators (such as scale-free networks) and graph modifiers. Most functions can be accessed through its GUI.
-
24
Suvi is a Java-library for graph visualization and a framework for developing graph visualization algorithms.
-
25
A graph layout optimizer based on the iterative application of laws of physics instead of using finite-pass algorithms.