Search Results for "graphs"

hello-algorithm is an educational repository designed to teach data structures and algorithms through clear explanations, visualizations, and code examples. It provides a structured learning path that covers fundamental concepts such as arrays, linked lists, trees, graphs, sorting algorithms, and dynamic programming. The project emphasizes understanding over memorization by breaking down complex topics into intuitive explanations supported by diagrams and examples. It is accessible to learners at different levels, from beginners to more advanced users who want to reinforce their knowledge. The repository often includes multilingual support, making it accessible to a broader audience. ...

Java generic API for search algorithms on graphs implicitly given by tree node expansion operator

This is a framework used to decompose hierarchical graphs, i.e.,graphs which were created from or contain a hierarchy of modules. Each module is reused several times in the hierarchy. This may be useful to reverse-engineer human constructs like electronic equipment, manufactured machines, or bureaucratic hierarchies; but also to decompose natural constructs like gene-relation or protein-relation nets.

[This project is frozen, but has an offspring with more features: https://github.com/jeffhain/jadecy ] JCycles provides treatments to compute cycles, or just strongly connected components, in directed graphs in general, or in classes or packages dependencies graphs parsed from class files (major version <= 51, else does best effort). It uses Tarjan's algorithm for SCCs, and Johnson's for cycles, with continuations instead of recursion, which allows to handle large graphs (< Integer.MAX_VALUE vertices). Requires Java 5 or later.

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). ...

Java library for operations with Iterables and other data structures in functional way.

The subgraph matching problem (subgraph isomorphism) is NP-complete. We designed a simple exact subgraph matching (ESM) algorithm for dependency graphs using a backtracking approach. The total worst-case algorithm complexity is O(n^2 * k^n) where n is the number of vertices and k is the vertex degree. We have demonstrated the successful usage of our algorithm in three biomedical relation and event extraction applications: BioNLP 2011 shared tasks on event extraction, Protein-Residue association detection and Protein-Protein interaction identification. ...

Project consists in a software that reads a copied web site to your computer and generates a graph model of it. The model is based on the links, which are seen as the edges, and the pages, which are the vertices of the graph.

A Java library and set of tools to quickly and easily manipulate graphs (set of nodes and edges) and dynamic graphs. The principal trait of this library is its ability to manage (create, edit, layout, display) continuously evolving graphs. The development of this project now takes place on Github. Visit the official Graphstream website at http://graphstream-project.org

GEECoP (Graphical Editor and Engine for Constrained Processes) is a tool to graphically design control-flow graphs and their associated constraints. It supports creation of Concurrent Transaction Logic formulas and validation of constrained processes.

Are Plain Old Java Objects (POJOs) to complex? The aim of this framework is, to convert JavaBeans (complex Java-Object graphs) in a simplified representation (JSON, XML, CSV or other object structures) or handle and control access to JavaBean properties.

sdf4j is a Java framework to manipulate Static Dataflow graphs (SDF).

Java objects that share parts of immutable graphs. Reused subgraphs have directly or indirectly recursive Elements. Selected components get replaced by new counterparts in Context of Mirrors - translation tables. Deep copies are not involved.

CSGraph is a simple graph library. It provides the most popular algorithms to create and manipulate graphs.