Search Results for "graph algorithm"
Sort By:
Showing 28 open source projects for "graph algorithm"
View related business solutions-
Unimus makes Network Automation and Configuration Management easy.We aim to make automation, disaster recovery, change management and configuration auditing painless and affordable for a network of any size.
-
Captain Compliance - Data Privacy and Compliance SoftwareCaptain Compliance handles your data privacy requirements so you can be privacy compliant. No more compliance stress, stop stressing over regulatory risks – just privacy protection managed by experts. Our user-friendly platform backed by privacy professionals simplifies the process of navigating regulations, giving your customers transparent choices, and building essential trust for your organization.
-
1
HugeGraph
A graph database that supports more than 100+ billion data
...Not only supports 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. -
2
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. -
3
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. ATC Online Alpha: https://advantrigoncalc.sourceforge.io/atc/ More info by clicking below: https://advantrigoncalc.sourceforge.io/ Advanced Trigonometry Calculator was only and always only developed by... -
4
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 vertices). Since version 1.1, can also compute shortest cycles covering all edges of SCCs. Usage from command line is also possible but with reduced flexibility (cf. ... -
Run applications fast and securely in a fully managed environmentRun frontend and backend services, batch jobs, deploy websites and applications, and queue processing workloads without the need to manage infrastructure.
-
5
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. -
6
java-string-similarity
Implementation of various string similarity and distance algorithms
...This was published by Masek in 1980 ("A Faster Algorithm Computing String Edit Distances"). -
7
Easy Machine Learning
Easy Machine Learning is a general-purpose dataflow-based system
...Our 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. -
8
popt4jlib
Parallel Optimization Library for Java
...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 network flow and other graph algorithms. A fast parallel implementation of the network simplex method, and some full-fledged parallel/distributed MIP solvers will be added in the next version. In general, emphasis is given in improving the efficiency of the algorithms in shared-memory models via java threads, since multi-core machines are so wide-spread today. -
9
PREESM provides a complete framework for fast prototyping. It generates a simulation and an optimized multiprocessor code from graph descriptions of algorithm and architecture. Please visit the project homepage at http://preesm.sourceforge.net.
-
Assembled is the only unified platform for staffing and managing your human and AI support team.Assembled is the only platform that unifies AI agents and intelligent workforce management to power fast and flexible support operations. Built for scale, we help teams automate over 50% of customer interactions, forecast with 90%+ accuracy, and optimize staffing across in-house and BPO teams. Orchestrate every chat, email, or call, balancing workloads between human and AI agents in real time — without sacrificing quality or control. Trusted by Stripe, Canva, and Robinhood, Assembled transforms support from a cost center into a strategic advantage. Our Workforce and Vendor Management tools connect forecasting, scheduling, and performance for smarter staffing decisions. AI Agents automate conversations across channels with your workflows and brand voice. AI Copilot empowers agents with real-time guidance, suggested replies, and one-click actions for faster, higher-quality resolutions.
-
10
A spring-based 3D graph layout tool written in Java. Rendering is performed in OpenGL via the JOGL library.
-
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 of major protein complexes in protein-protein interaction and signalling networks, Bioinformatics 35(21):4490-4492 https://academic.oup.com/bioinformatics/article/35/21/4490/5475596 Our detailed Tutorial on the use of the plugin: https://suopte.com/entopt_2_1_tutorial_20200518.pdf A video about the version 2.1: http://suopte.com/entopt_2_1_tutorial_video.mp4 Don't hesitate to send any questions, comments or bug reports also to agg.bence {at} med.semmelweis-univ.hu. -
12
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/ -
13
sWangTiler
A java implementation that generates wang tiles from any input image.
...Wang tiles greatly reduce visible repetitions making textures seem more natural and thus improve the quality of any graphic application like games, simulations etc. This implementation is based on the strict wang tile algorithm as proposed by Xinyu Zhang and Young J. Kim in "Efficient Texture Synthesis Using Strict Wang Tiles". In order to calculate the lowest cost path between any edge- and sample image an implementation of Dijkstra's algorithm is used which was found in the java graph library 'JGraphT'. Credits to all mentioned parties and to http://www.texturemate.com/. -
14
Approximate Subgraph Matching Algorithm
Approximate Subgraph Matching Algorithm for Dependency Graphs
The subgraph matching problem (subgraph isomorphism) is NP-complete. Previously, we designed an exact subgraph matching (ESM) algorithm for dependency graphs using a backtracking approach (http://esmalgorithm.sourceforge.net). We further designed an approximate subgraph matching (ASM) algorithm that is capable of detecting approximate subgraph matching based on a subgraph distance. Assume that the graph G and the subgraph Gs have m and n vertices, and km and kn edges respectively, the total worst-case algorithm complexity is O(m^n * n(n-1)/2 * km * log m). ... -
15
MbPc Pagerank Simulator
Testbed for playing with the algorithm "pagerank" of Google
Provide a testbed to play with pagerank-like algorithm on graph. You can easily add vertices, edges, save the graph for reuse, etc. For now, only Pagerank is implemented, but in the future, other algorithms will be added. -
16
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.
-
17
Pure Java implementation of an interactive 3d graph rendering engine and editor using a spring embedder algorithm. Nice looking sterile real time 3d environment. Feel free to extend our project and build something awesome, just let us know please :D
-
18
We propose a metabolic pathway drawing algorithm for reducing the number of edge crossings by considering the fact that metabolic pathway graph is scale-free network.
-
19
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.
-
20
RoxGT its an open source framework for building Graph-based applications. It has been built essentially for academic jobs, such as graph algorithm execution and theorem proofs.
-
21
JPowerGraph is a Java library for creating directed graphs for both Swing and SWT. It supports graph movement, selection, context menus, tooltips and dynamic edge creation. JPowerGraph has a spring layout algorithm based on that used in TouchGraph.
-
22
Simple Java Graph is a minimal matrix- and listbased graph implementation. An AStar search algorithm is also available.
-
23
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.
-
24
This project aims to provide developers a convenient library about graph theory algorithm and some basic data structures. It will be developed in Java via Eclipse IDE, supporting both win32 and linux systems, and published as jar files.
-
25
My program to make possible simulation of algorithm on 3-dimensional graph. We can also to create or load 3-dimensional graph and start differents algorithm. On my home page is available this program as applet. You can run applet if you were using a Java
