Search Results for "graph algorithm" - Page 2
Sort By:
Showing 62 open source projects for "graph algorithm"
View related business solutions-
Over two-thirds of people reuse passwords across sites, resulting in an increasingly insecure e-commerce ecosystem. Learn how passwordless can not only mitigate these issues but make the authentication experience delightful. Implement Auth0 in any application in just five minutes
-
Boost application security and continuity with SKUDONET ADC, our Open Source Load Balancer, that maximizes IT infrastructure flexibility. Additionally, save up to $470 K per incident with AI and SKUDONET solutions, further enhancing your organization’s risk management and cost-efficiency strategies.
-
1
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.
-
2
We consider a problem of finding maximum weight subgraphs (MWS) that satisfy hard constraints in a weighted graph. The constraints specify the graph nodes that must belong to the solution as well as mutual exclusions of graph nodes, i.e., pairs of nodes that cannot belong to the same solution. Our main contribution is a novel inference approach for solving this problem in a sequential monte carlo (SMC) sampling framework. Usually in an SMC framework there is a natural ordering of the states...
-
3
Graph_DF_Layout
A force directed graph layout algorithm implementation in Processing
-
4
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. -
WorkforceHub is the instantly useful, delightfully simple to use, small business solution for tracking time, scheduling and hiring. It scales as your business grows while delivering the mission-critical features an organization needs. It is tailored to, built for, and priced for small business employers.
-
5
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. -
6
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. -
7
LTS: Learning To Search
Discriminative subgraph mining by learning from search history
This is an optimized Java implementation of the algorithm from "LTS: Discriminative Subgraph Mining by Learning from Search History" in Data Engineering (ICDE), IEEE 27th International Conference, pages 207-218, 2011. The Learning to Search (LTS) algorithm mines for discriminative subgraphs. Given two sets of graphs, with one set labelled positive, it finds subgraphs that are common in the positive graphs and uncommon in the negative graphs. In other words, the occurrences of these subgraphs... -
8
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.
-
9
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... -
Define and Deliver Comprehensive Cybersecurity Services. Security threats continue to grow, and your clients are most likely at risk. Small- to medium-sized businesses (SMBs) are targeted by 64% of all cyberattacks, and 62% of them admit lacking in-house expertise to deal with security issues. Now technology solution providers (TSPs) are a prime target. Enter ConnectWise Cybersecurity Management (formerly ConnectWise Fortify) — the advanced cybersecurity solution you need to deliver the managed detection and response protection your clients require. Whether you’re talking to prospects or clients, we provide you with the right insights and data to support your cybersecurity conversation. From client-facing reports to technical guidance, we reduce the noise by guiding you through what’s really needed to demonstrate the value of enhanced strategy.
-
10
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... -
11
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... -
12
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. -
13
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...
-
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
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. -
17
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.
-
18
Game Toolbox is a C# assembly designed to facilitate the creation of games and game prototypes. It contains no graphics code, does not depend on XNA, and is Mono-compatible. It provides implementations of A*, GOAP, a genetic algorithm, and more.
-
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
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.
-
21
Program predicts a jam for chosen task on road graph. Data example: http://imat2010.yandex.ru There are 30 days with information about jams since 16:00 till 22:00. Need to predict jams at 31st. Algorithm is based on SVM library. BSD license.
-
22
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
-
23
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.
-
24
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.
-
25
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.