Search Results for "graph algorithm" - Page 3
Sort By:
Showing 105 open source projects for "graph algorithm"
View related business solutions-
Gen AI apps are built with MongoDB AtlasMongoDB Atlas is the developer-friendly database used to build, scale, and run gen AI and LLM-powered apps—without needing a separate vector database. Atlas offers built-in vector search, global availability across 115+ regions, and flexible document modeling. Start building AI apps faster, all in one place.
-
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.
-
1
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. -
2
Graphal
Graph algorithms interpreter, IDE, debugger, 3D visualizations.
Graphal is an interpreter of a programming language that is mainly oriented to graph algorithms. There is a command line interpreter and a graphical integrated development environment. The IDE contains text editor for programmers, compilation and script output, advanced debugger and visualization window. The progress of the interpreted and debugged graph algorithm can be displayed in 3D scene. -
3
TSPLib.Net
TSPLib wrapper for .Net
TSPLib is a set of Traveler Salesman and related graph problems gathered by the Heidelberg university. This project provides .Net library wrapping up library files loading code, implements distance functions and all the TSPLib features. If you'd like to test your graph tour searching algorithm on a TSP lib will save you hours of reading in a data and adjusting your code to ensure that result are comparable. Delivering as a dll with .Net wrapper and a zip archive with all the original... -
4
PageRank for wikipedia
PageRank algorithm for wikipedia pages on Amazon Elastic MapReduce
• Implemented the project using PageRank algorithm for Wikipedia pages on Amazon Elastic MapReduce. • Designed MapReduce jobs for red links removal, outlink adjacency graph, compute the total number of pages, PageRank calculation, sorting of PageRanks. • To run the project on amazon Elastic MapReduce specify jar location. Pass the directory locations as an argument of input and output respectively. -
Crowdtesting That Delivers | TesteumTesteum connects your software, app, or website to a worldwide network of testers, delivering detailed feedback in under 48 hours. Ensure functionality and refine UX on real devices, all at a fraction of traditional costs. Trusted by startups and enterprises alike, our platform streamlines quality assurance with actionable insights.
-
5
3DScape is the first plug-in which enables three-dimensional network visualization in Cytoscape. 3DScape features include accessing graph appearance, layout algorithm, and animation effects on a series of expression data.
-
6
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... -
7
ProGraphMSA
Graph-based multiple sequence alignment
ProGraphMSA is a state-of-the-art multiple sequence alignment tool which produces phylogenetically sensible gap patterns while maintaining robustness by allowing alternative splicings and errors in the branching pattern of the guide tree. This is achieved by incorporating a graph-based sequence representation as in POA and combines it with the advantages of the phylogeny-aware algorithm in Prank. Further, we account for variations in the substitution pattern by using estimated amino acid... -
8
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... -
9
Mix
Mix is a tool to combine multiple assemblies from NGS data.
Mix is a tool that combines two or more draft assemblies, without relying on a reference genome and has the goal to reduce contig fragmentation and thus speed-up genome finishing. The proposed algorithm builds an extension graph where vertices represent extremities of contigs and edges represent existing alignments between these extremities. These alignment edges are used for contig extension. The resulting output assembly corresponds to a path in the extension graph that maximizes... -
Sales CRM and Pipeline Management Software | PipedrivePipedrive’s simple interface empowers salespeople to streamline workflows and unite sales tasks in one workspace. Unlock instant sales insights with Pipedrive’s visual sales pipeline and fine-tune your strategy with robust reporting features and a personalized AI Sales Assistant.
-
10
PID Simulator
Version 2 is out!
Try version 2! Total separation of physical simulation, PID algorithm and GUI. The setup is intended to realistically mimic a physical body with a specific heat capacity, a measurement delay, and an input delay + low pass filter (heater delay) for more realism. This is a simple PID simulator I wrote in .NET, created to get a feel of how to tune a PID by adjusting the various properties. -
11
GrAMP
Graph Algorithm in MetaPost
A software tool to make easily graph algorithm illustrations in MetaPost. The resulting MetaPost-files can e.g. be incorporated in LaTeX-documents. -
12
Griso is a graph isomorphism testing utility written in C++. It is based on my own POLYNOMIAL-TIME (in this point the salt of the project) algorithm. See Griso's sample input/output on http://funkybee.narod.ru/graphs.htm page. Edit (2012-10-24): seems so far it works for *regular graphs only* and should be tested on such graphs. Edit (2012-10-25): see two counterexamples in README.txt. But yet if Griso's verdict is "NON-isomorphic" it's 100% correct, so you can still make use of it. PS...
-
13
Track Animation
A simple application which simulates Disk Scheduling Algorithms.
Track Animation is an easy to use Windows application that simulates the following Disk Scheduling Algorithms : FCFS (First Come First Serve), SJF (Shortest Job First) aka SSTF (Shortest Seek Time First), SCAN (Elevator Algorithm), LOOK, C-SCAN (Circular SCAN) and C-LOOK. This application enables the user to play and pause the simulation after providing the necessary simulation requirements. -
14
Intelligent Water Drops Algorithm
Solving optimization problems by the Intelligent Water Drops algorithm
This project deals with the Intelligent Water Drops algorithm or the IWD algorithm. The IWD algorithm is a population & nature-inspired combinatorial optimization algorithm. It tries to imitate the behavior that natural water drops conduct in river beds where they create complex paths that seem optimistic considering the environment, obstacles, and the surrounding terrain. One way to use the IWD algorithm is to map our optimization problem into a graph over which Intelligent Water Drops (IWDs... -
15
graphseg
Library for segmenting a graph, images in particular.
Primarily this library was developed for producing a set of super-pixels from an image (i.e. an over-segmentation). The segmentation is produced by running multiple instances of Dijkstra's Algorithm from a set of seed points; those nodes which belong to a given Dijkstra cloud form a segment (so the number of segments is fixed and determined at the beginning of the algorithm). The goal is to add code that moves from the over-segmentation to a more useful segmentation. The library includes... -
16
implementation of "GAIA: graph classification using evolutionary computation" in SIGMOD'10. a discriminative subgraph pattern mining algorithm using evolutionary computation implemented by the author
-
17
Grafoanalizator
Graphanalyzer is an environment for visualization of graphsand process
Graphanalyzer is an environment for visualization of graphsand processes with different algorithms. Program supports about 20 algorithms. Program shows visual result of algorithm. You can solve lot of engineering tasks with Graphanalyzer. Learn more about program Graphanalyzer. Features: 1. About 20 algorithms. 2. Visualization of all the processes of graph processing. 3. Supporting helper function for graph creating as map. 4. Feedback. -
18
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. -
19
The Atlas-Link software implements a greedy algorithm and uses graph theory to link and orient assembled existing contigs quickly and accurately using mate pair information.
-
20
Cgraph simulator is a tool to simulate common graph algorithms like bfs,dfs etc specially designed for algorithm learners. For detailed info visit: http://www.shafaetsplanet.com/cgraph/
-
21
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.
-
22
BIL++ is a set of standalone C++ packages for data processing in Bioinformatics (Graph mining, Bayesian networks, Genetic algorithm, Discretization, Gene expression data analysis, Hypothesis testing).
-
23
Nathalie - an educational algorithm program, with focus on graph algorithms and didactic presentation. As of April 2011 we are finishing the designing phase.
-
24
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.
-
25
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.
