Search Results for "graph algorithms" - Page 2
Sort By:
78 projects for "graph algorithms" with 1 filter applied:
-
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.
-
Secure File Transfer for Windows with Cerberus by RedwoodCerberus supports unlimited users and connections on a single IP, with built-in encryption, 2FA, and a browser-based web client — all deployable in under 15 minutes with a 25-day free trial.
-
1
Prolog+CG is a Java implementation of Prolog with extensions implementing a subset of the Conceptual Graph (CG) theory of John Sowa. CGs are first-class datatypes on a par with terms. Object oriented extensions are also included.
-
2
Your basic graph
Graph algorithms and data structures
...The tool is part of a larger library of generic graph algorithms. -
3
This project aims to develop and share fast frequent subgraph mining and graph learning algorithms. Currently we release the frequent subgraph mining package FFSM and later we will include new functions for graph regression and classification package
-
4
JavaGimmicks
Utility classes, APIs and tools for Java
A set of helper and utility classes, APIs and tools for the Java Programming Language. For more details - pleas visit the project homepage. -
Ship Agents FasterGemini Enterprise Agent Platform lets you rapidly build, scale, govern and optimize production-ready agents grounded in your organization's data. The platform enables developers to build custom or pre-built agents for virtually any use case. New customers get $300 in free credits.
-
5
Algorithms in Python
Data Structures and Algorithms in Python
Algorithms in Python is a collection of algorithm and data structure implementations (primarily in Python) meant to serve as both learning material and reference code for engineers. It includes code for graph algorithms, heap data structures, stacks, queues, and more — each implemented cleanly so learners can trace logic and adapt for their problems. -
6
Excel file analysis toolkit
Lays out dependencies (links) between Excel files in a visual graph
Do you have a haystack (legacy) of Excel files that reference each other and you can't see clear anymore? This tools crawls Excel files and builds up a visual graph. It shows which files might be outdated because they reference a file which was modified more recently. The graph is dynamic, you can choose between different layout algorithms and rearrange by hand. Allows you to quickly open the file, dump the graph, dump all links within a file, highlight all the cells that reference other excel files. ... -
7
Peklo is a graph editor and an environment for visualizing and comparing different algorithms for some graph-theoretic problems, e.g. flows, shortest path, minimum spanning tree.
-
8
ISO GrAF
Experimental Java library for reading and writing GrAF/XML files.
The Graph Annotation Framework (GrAF) models linguistic annotations using a data model based on Graph theory and algorithms. The GrAF standard is a work product of ISO TC37SC4 Working Group 1. This Java library is NOT part of the GrAF standard and standoff annotation files produced by the library may not be GrAF compliant. -
9
Graph-RAT is a database abstraction layer designed to make it easy to use a large library of graph-analysis routines on a database as well as add new kinds of algorithms to data mining.
-
$300 Free Credits to Build on Google CloudStart your next project with $300 in free Google Cloud credit. Spin up VMs, run containers, query petabytes in BigQuery, or build agents with Gemini Enterprise Agent Platform. Once your credits are used, keep building with 20+ always-free tier products including Compute Engine, Cloud Storage, GKE, and Cloud Run functions. No commitment required—just sign up and start building.
-
10
nail_systems_biology
NAIL is a toolset for network analysis in the life sciences
...However, different algorithms typically use different input and output data types, are implemented using different technologies, and are demonstrated by application to different biological problems. Because of this, the primary goal of the NAIL project is to provide a straightforward way to use network approaches in the life sciences, and to apply a variety of techniques quickly and easily on the same data. -
11
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. -
12
SPARGEL
An opensource Java graph library. Abandoned, ignore.
...As now, implemented are: * Adjecency graph data structures * Algorithms: SSSP, APSP, Traversal, Min-Cut, Max-Flow, Many types of finding Components * Creating sub graphs, vertice and edge maps that use a function to implement their mapping. Spargel is released under GPLv3 -
13
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,... -
14
NaruGo is game AI project. Current targets are GO board game and Texas Holdem poker. It investigates Genetic programming to build game AI logic. Also EA/GP simulations for TSP, Graph layout and Prisoners Dilemma problem.
-
15
JSort is a library with some sorting algorithms implementation and related data structure. It has compare-based algorithms, linear sorting, graph sorting, priority based queue, and so on.
-
16
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.
-
17
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.
-
18
GraphLayout is a utility to draw large graphs (up to 5000 nodes). It allows you to experiment with different cost functions and algorithms. It also has an external utility which needs to measure the graph quality or its topological features.
-
19
Software for graphs visualization, encouraging graph algorithms implementation. Aimed at students who want to code their own algorithms and see a graphical representation of it working.
-
20
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.
-
21
A threaded Web graph (Power law random graph) generator written in Python. It can generate a synthetic Web graph of about one million nodes in a few minutes on a desktop machine. It implements a threaded variant of the RMAT algorithm.
-
22
GrALoG is a tool for editing and visualising graph-like-structures and the results of algorithms running on them. Through it's plugins GrALoG is hugely extendable, i.e. plugin-developers can define their own graph-like structures and algorithms.
-
23
-
24
-
25
APSGraph is a C++ object-oriented library for graph data and algorithms. The main objective of this library is to provide a maximum algorithms performance.