ijdigraph

Ijdigraph is a software library designed to support the construction, manipulation, and analysis of directed graphs. It provides a lightweight, language-agnostic core API intended for researchers, educators, and software developers who work with graph-based data.

The core data model represents graphs as a collection of vertices connected by directed edges, with optional weights and vertex attributes. It emphasizes a simple adjacency-list implementation and a clean interface for adding or removing nodes and edges, querying connectivity, and iterating over neighbors.

Algorithms included in ijdigraph cover common needs for directed graphs, such as depth-first search, breadth-first search, topological sorting, cycle detection, and shortest-path methods (Dijkstra’s and Bellman-Ford). It also provides routines for computing strongly connected components and basic reachability queries.

Input and output support serialization and deserialization to formats like GraphML, JSON, and edge lists, enabling easy integration with data pipelines and visualization tools. The library also offers hooks for custom graph plugins and extension points for additional algorithms.

Implementation and usage focus on a modular design with a core that can be embedded in applications and lightweight language bindings for popular programming environments. The API aims to be explicit and predictable, with documentation and examples to help new users prototype graph-based workflows and build analytical tools on directed graphs.

See also: Graph theory, Directed graph, Graph algorithm, Network analysis.