Search Results for "graph algorithm"
Sort By:
Showing 27 open source projects for "graph algorithm"
View related business solutions-
Red Hat Enterprise Linux (RHEL) on Microsoft Azure provides a secure, reliable, and flexible foundation for your cloud infrastructure. Red Hat Enterprise Linux on Microsoft Azure is ideal for enterprises seeking to enhance their cloud environment with seamless integration, consistent performance, and comprehensive support.
-
With the world of work changed forever, it’s essential to manage your workplace and assets together to effectively create a high-performing environment. The Eptura experience combines the power of workplace management software with asset management, enabling you to effectively operate your building and facilitate hybrid work.
-
1
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. -
2
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... -
3
gml4gtk
small console GML or graphviz DOT graph viewer
directed graph layout program for GML (Graph-Markup-Language) graph or partial graphviz DOT graph -
4
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. -
A state-of-the-art cloud-based classroom management solution that provides educators with the tools to facilitate efficient collaborative distance learning in or outside the classroom. Share your screen, video camera and whiteboard in lecturer mode or group collaboration, remotely monitor and assist students in real-time. Streamline the learning experience and keep your finger on the classroom pulse.
-
5
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. -
6
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.
-
7
popt4jlib
Parallel Optimization Library for Java
popt4jlib is an open-source parallel optimization library for the Java programming language supporting both shared memory and distributed message passing models. 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... -
8
A spring-based 3D graph layout tool written in Java. Rendering is performed in OpenGL via the JOGL library.
-
9
Satsuma .NET Graph Library
a delicious .NET graph library
Satsuma is a graph library for .NET, written in C#. Satsuma is an easy-to-use and flexible library, which implements all the necessary graph structures, and the fastest possible graph algorithms. DOCUMENTATION: http://satsumagraph.sourceforge.net/ Satsuma is not a charting library. 'Graph' is used in the mathematical sense here (e.g. nodes connected with arcs). Satsuma is released under the zlib license. This license is very permissive and allows you to use Satsuma for both personal... -
Frazer provides full-featured used car dealer software to independent auto dealers. Frazer's goals have always been simple– to provide dealers with a high-quality, easy-to-use Dealer Management System, at an affordable price, while ensuring that a friendly, knowledgeable support staff is there to back it up. Request a free trial to see what everyone in the automotive industry is talking about.
-
10
A star
it is an implementation of A* algorithm with examples of its usage.
A start (A*) is the algorithm for searching the shortest path in the weighted graphs. My implementation is provided with various interesting applications, i.e. 15 puzzle. This project is related to my other projects located at sourceforge as well: https://sourceforge.net/projects/path-finder-qt/ https://sourceforge.net/projects/shortest-path-graph-a-star/ For detail of A* algorithm see wiki page: https://en.wikipedia.org/wiki/A*_search_algorithm -
11
Visualization of Protein-Ligand Graphs
Compute protein graphs. Moved to https://github.com/MolBIFFM/PTGLtools
NOTE: Project moved to https://github.com/MolBIFFM/PTGLtools. The Visualization of Protein-Ligand Graphs (VPLG) software package computes and visualizes protein graphs. It works on the super-secondary structure level and uses the atom coordinates from PDB files and the SSE assignments of the DSSP algorithm. VPLG is command line software. If you do not like typing commands, try our PTGL web server: http://ptgl.uni-frankfurt.de/ -
12
SplitMEM
Graphical pan-genome analysis with suffix skips
With the rise of improved sequencing technologies, genomics is expanding from a single reference per species paradigm into a more comprehensive pan-genome approach with multiple individuals represented and analyzed together. Here we introduce a novel O(n log n) time and space algorithm called splitMEM, that directly constructs the compressed de Bruijn graph for a pan-genome of total length n. To achieve this time complexity, we augment the suffix tree with suffix skips, a new construct... -
13
Cell decomposition is one of the first applicable solution for path planning - robot path planning. The algorithm aims to find free areas (cells not occupied by obstacles) in the configuration space, and build a graph of adjacency for these cells.
-
14
The MaxParser is written in c++ and can parse with first, second, third and fourth order projective Graph-based Dependency parsing algorithm. The project is the new version of the project "Max-MSTParser". If you want to use this software for research, please reference this web address in your papers
-
15
MolSig
The Stereo Signature Molecular Descriptor
An algorithm to compute molecular graph descriptors considering the stereochemistry of the molecular structure, based on our previously introduced signature molecular descriptor. The algorithm can generate two types of descriptors, one which is compliant with the Cahn-Ingold-Prelog priority rules, and a faster one based on our previous definition of a directed acyclic graph that isaugmented to a chiral molecular graph. -
16
LTS: Learning to Search
Discriminative subgraph mining by learning from search history
LTS (Learning to Search) is an implementation of an algorithm described in "LTS: Discriminative Subgraph Mining by Learning from Search History" in Data Engineering (ICDE), IEEE 27th International Conference, pages 207-218, 2011. The purpose of LTS is to find discriminative subgraphs, which are smaller graphs that are embedded in larger graphs that all share a certain trait. A discriminative subgraph can help to characterize a complex graph and can be used to classify new graphs with unknown... -
17
The E* algorithm is a path planner for (mobile) robotics. Unlike A*, which constrains movements to graph edges, it produces smooth trajectories by interpolating between edges. Like D*, it supports dynamic replanning after local path cost changes.
-
18
LSGTL means LLX’s Static Graph Template Library which is a light-weighted header-only template library developed mainly for static graph analysis. LSGTL is expected to be used in laboratories for research purposes mostly.
-
19
BorderFlow implements a general-purpose graph clustering algorithm. It maximizes the inner to outer flow ratio from the border of each cluster to the rest of the graph.
-
20
C++ Graph is a port of the Annas.Graph Java Library to C++. Visual components are excluded from this port. Will support Breadth First and Depth First Searches, Djikstra Algorithm for shortest path.
-
21
G.A.V. (Graph Algorithm Visualizer) is a tool that visualizes algorithms from graph theory. A step-by-step visualization from each different algorithm allows the user to understand the particular algorithm very easily.
-
22
Simple Java Graph is a minimal matrix- and listbased graph implementation. An AStar search algorithm is also available.
-
23
A .NET implementation of the Gabow, Kaplan, Tarjan algorithm for testing the uniqueness of a perfect matching in a general graph.
-
24
jGABL (the Java Graph Algorithm Base Library) is a java library for the implementation of graph algorithms. It covers a hierarchy of graph concepts, various graph implementations, and algorithm animation.
-
25
The "Framework for Implicit Graph Algorithms and Representations by OBDDs" (Figaro) automatically manages experiments with input generator and algorithm plugins. It already contains some generators and algorithms for graph and scheduling problems.