Search Results for "graph algorithm"
Sort By:
Showing 105 open source projects for "graph algorithm"
View related business solutions-
Get Avast Free Antivirus | Your top-rated shield against malware and online scamsOur antivirus software scans for security and performance issues and helps you to fix them instantly. It also protects you in real time by analyzing unknown files before they reach your desktop PC or laptop — all for free.
-
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.
-
1
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... -
2
TorchQuantum
A PyTorch-based framework for Quantum Classical Simulation
A PyTorch-based framework for Quantum Classical Simulation, Quantum Machine Learning, Quantum Neural Networks, Parameterized Quantum Circuits with support for easy deployments on real quantum computers. Researchers on quantum algorithm design, parameterized quantum circuit training, quantum optimal control, quantum machine learning, and quantum neural networks. Dynamic computation graph, automatic gradient computation, fast GPU support, batch model terrorized processing. -
3
Vald
Vald. A Highly Scalable Distributed Vector Search Engine
Vald is a highly scalable distributed fast approximate nearest neighbor dense vector search engine. Vald is designed and implemented based on the Cloud-Native architecture. It uses the fastest ANN Algorithm NGT to search for neighbors. Vald has automatic vector indexing and index backup, and horizontal scaling which is made for searching from billions of feature vector data. Vald is easy to use, feature-rich and highly customizable as you needed. Usually, the graph requires locking during... -
4
HugeGraph
A graph database that supports more than 100+ billion data
... Gremlin graph query language and RESTful API but also provides commonly used graph algorithm APIs. To help users easily implement various queries and analyses, HugeGraph has a full range of accessory tools, such as supporting distributed storage, data replication, scaling horizontally, and supports many built-in backends of storage engines. -
Gen AI apps are built with MongoDB AtlasMongoDB Atlas provides built-in vector search and a flexible document model so developers can build, scale, and run gen AI apps without stitching together multiple databases. From LLM integration to semantic search, Atlas simplifies your AI architecture—and it’s free to get started.
-
5
amrlib
A python library that makes AMR parsing, generation and visualization
... in both the GUI and as library functions. Training and test code for both the StoG and GtoS models. A SpaCy extension that allows direct conversion of SpaCy Docs and Spans to AMR graphs. Sentence to Graph alignment routines FAA_Aligner (Fast_Align Algorithm), based on the ISI aligner code detailed in this paper. RBW_Aligner (Rule Based Word) for a simple, single token to single node alignment. -
6
Go Recipes
Collection of handy tools for Go projects
Visualize the distribution of code coverage in your project. This helps to identify code areas with high and low coverage. Useful when you have a large project with lots of files and packages. This 2D image-hash of your project should be more representative than a single number. For each module, the node representing the greatest version (i.e., the version chosen by Go's minimal version selection algorithm) is colored green. Other nodes, which aren't in the final build list, are colored grey... -
7
Metatheory.jl
General purpose algebraic metaprogramming
... of functional combinators for classical term rewriting and an e-graph rewriting, a fresh approach to term rewriting achieved through an equality saturation algorithm. Metatheory.jl can manipulate any kind of Julia symbolic expression type, as long as it satisfies the TermInterface.jl. -
8
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. More info by clicking below: https://advantrigoncalc.sourceforge.io/ Advanced Trigonometry Calculator was only and always only developed by the Portuguese Renato Alexandre dos Santos Freitas. Also author of... -
9
HiPS : Hierarchical Petri net Simulator
HiPS tool features to design and analyze hierarchical Petri nets
HiPS tool is developed at the Department of Computer Science and Engineering, Shinshu University, which is a tool design and analysis of Petri nets, developed using Microsoft Visual C # and C++. HiPS tool has a way of intuitive GUI which enable hierarchical and/or timed-net design. HiPS tool has also functions of static/dynamic analysis : T-invariant detection, Reachability path analysis, deadlock state detection, and k-boundedness analysis. In addition, it is possible to perform a random... -
Powering the best of the internet | FastlyEnsure your websites, applications and services can effortlessly handle the demands of your users with Fastly. Fastly’s portfolio is designed to be highly performant, personalized and secure while seamlessly scaling to support your growth.
-
10
Hypercube
Graph visualizing tool
Hypercube is a tool for visualizing DOT (graphviz), GML, GraphML, GXL and simple text-based graph representations as SVG and EPS images. Hypercube comes with a Qt based GUI application and a Qt-independent command-line tool. It uses a simulated annealing algorithm to lay out the graph, that can be easily parameterized to achieve the desired look. The main development goals are portability and easy usage rather than high performance and complexity. -
11
TAS: Task assignment solver
Task assignment solver
... includes a 30 lines-of-code Lua version of Andrey Lopatin's version, given in: Alessandro Minisini, Oleksandr Kulkov. "Hungarian algorithm for solving the assignment problem." Dec 13, 2023. [https://cp-algorithms.com/graph/hungarian-algorithm.html]. -
12
calculatorpp
Calculator++
Written in C++ (using template). Calculator++ is a application/library for Window (POSIX). The core of code is adaptable for posix. This algorithm support: + built-in operator + built-in functions + run-time functions and variables definition + run-time units system, units with prefix + constants definition + Pretty mathematical expressions - Process ascii files (dev) - vector and matrix (dev) - graph 2D and 3D (dev) - vector graph (dev... -
13
dorban
A demo for the Svarog AI library.
This project is a demo based on a Svarog AI library, which can be downloaded from https://github.com/pawelbiernacki/svarog . It contains a player (Pregor) controlled by the user and an NPC (Dorban) controlled by the Svarog interpreter. The objective is to kill the vampire. Or at least to attack him with the optimal chances. The Svarog AI library contains a new optimization algorithm based on so called hidden variables. In order to achieve the objective Dorban will try to convince Pregor... -
14
Mind Guard Droid
Mind Guard OS Made For Minds
Have you ever wanted to have a Mobile Anti Mind Control device?. Now you can! with Mind Guard Droid for Android. Complete Linux Installer, is an application for the Android that enables users to boot Mind Guard X OS from an Android device via chroot. The user interacts with the Mind Guard X OS via VNC. Mind Guard is the Glasses. -
15
Jadecy
Java lib to compute (code) deps, SCCs, and cycles (Johnson algorithm).
Jadecy (Java Dependencies and Cycles) is a Java library to compute dependencies (elements depended on, or depending), strongly connected components, and cycles, in general directed graphs, or classes or packages dependencies graphs parsed from class files (major version <= 52, else does best effort). It uses Tarjan's algorithm for SCCs computation, and Johnson's algorithm for exhaustive cycles computation, with continuations instead of recursion, which allows to handle large graphs (< 2^31... -
16
MACE
Deep learning inference framework optimized for mobile platforms
Mobile AI Compute Engine (or MACE for short) is a deep learning inference framework optimized for mobile heterogeneous computing on Android, iOS, Linux and Windows devices. Runtime is optimized with NEON, OpenCL and Hexagon, and Winograd algorithm is introduced to speed up convolution operations. The initialization is also optimized to be faster. Chip-dependent power options like big.LITTLE scheduling, Adreno GPU hints are included as advanced APIs. UI responsiveness guarantee is sometimes... -
17
HipMer
A High performance distributed memory assembler for big genomic data
... and accuracy in metagenomic assemblies. It is able to reconstruct rRNA elements via a separate algorithm which relies on reference SSU and LSU Hidden Markov Models to help traverse the contig graph around ribosomal RNA regions. For more information and publications visit the HipMer Portal (http://portal.nersc.gov/project/hipmer/) MetaHipMer is one component of the ExaBiome project (https://sites.google.com/lbl.gov/exabiome/home), part of the Exascale Computing Project: https://www.exascaleproject.org/ -
18
2D Heat Transfer in .C
2D Heat Numerical Heat Transfer Solver
PLEASE NOTE: There is a complete installer available if you do not have CVI installed. If you do have it, you can simply download the source files and run them. The following program was built as a final evaluation project for Programming for Mechatronics Course for my BSc. in Mechanical Engineering. This solver is based around the Gauss-Seidel algorithm for 2D heat transfer for pre-determined boundary conditions (i.e. user defined temperatures). I hope this project will be useful... -
19
gml4gtk
small console GML or graphviz DOT graph viewer
directed graph layout program for GML (Graph-Markup-Language) graph or partial graphviz DOT graph -
20
BifurcumLib
A library for running through a directional graph.
This is the library for the project Bifurcum. It does all the work. It has a simple algorithm (Deep First Search with modifications) and allows sorting children before traversing. This library sums up the authors 4-years experience when programming a commercial tool for graph traversing (which used a much more advanced algorithm) and coaching its users. -
21
Bifurcum
Software to run through a directional graph.
This software runs through a directional graph and writes the paths it found as test specifications. It has a simple algorithm (Deep First Search with modifications) and allows sorting children before traversing. This application sums up the authors 4-years experience when programming a commercial tool for graph traversing (which used a much more advanced algorithm) and coaching its users. Technically it is a front end for the library Bifurcumlib. -
22
java-string-similarity
Implementation of various string similarity and distance algorithms
... below. The "cost" column gives an estimation of the computational cost to compute the similarity between two strings of length m and n respectively. If the alphabet is finite, it is possible to use the method of four russians (Arlazarov et al. "On economic construction of the transitive closure of a directed graph", 1970) to speedup computation. This was published by Masek in 1980 ("A Faster Algorithm Computing String Edit Distances"). -
23
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.
-
24
MetaPA is a de Bruijn graph algorithm to obtain complete protein coding genes by assembling metagenomic and metatranscriptomic short reads. Jiemeng Liu*, Qichao Lian*, Yamao Chen, Ji Qi. (2019) Amino acid based de Bruijn graph algorithm for identifying complete coding genes from metagenomic and metatranscriptomic short reads. Nucleic Acids Research.
-
25
Easy Machine Learning
Easy Machine Learning is a general-purpose dataflow-based system
... platform Easy Machine Learning presents a general-purpose dataflow-based system for easing the process of applying machine learning algorithms to real-world tasks. In the system, a learning task is formulated as a directed acyclic graph (DAG) in which each node represents an operation (e.g. a machine learning algorithm), and each edge represents the flow of the data from one node to its descendants.
