Diblob: A Python framework for computations on digraphs as software models with focus on effective test case design

Directed graphs (digraphs) are one of the basic software models. In particular, they are used to design test cases based on certain graph coverage criteria. This paper introduces Diblob – a Python package designed for computations on digraphs, emphasizing use in software testing. It does not depend on external packages and operates on JSON representations of digraphs, which makes it a universal tool. Diblob allows for a hierarchical representation of digraph structures to create software models suitable for test cases requiring state machine coverage, abstracting – where necessary – from analyzing specific graph elements (e.g., strongly connected components). Diblob also implements several algorithms for achieving graph-based test coverage criteria.

Authors

Institutions

Publication Details

Journal
SoftwareX
Published
2025-11-22
DOI
https://doi.org/10.1016/j.softx.2025.102452
Primary Topic
Software Testing and Debugging Techniques
Type
article
Field-Weighted Citation Impact
0.00
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

Diblob: A Python framework for computations on digraphs as software models with focus on effective test case design

Adam Roman, Jakub Zelek
SoftwareX
Software Testing and Debugging Techniques
article

Diblob: A Python framework for computations on digraphs as software models with focus on effective test case design

Adam Roman, Jakub Zelek
article en

Abstract

Directed graphs (digraphs) are one of the basic software models. In particular, they are used to design test cases based on certain graph coverage criteria. This paper introduces Diblob – a Python package designed for computations on digraphs, emphasizing use in software testing. It does not depend on external packages and operates on JSON representations of digraphs, which makes it a universal tool. Diblob allows for a hierarchical representation of digraph structures to create software models suitable for test cases requiring state machine coverage, abstracting – where necessary – from analyzing specific graph elements (e.g., strongly connected components). Diblob also implements several algorithms for achieving graph-based test coverage criteria.

SoftwareXVol. 32
Jagiellonian University (PL)
Openalex Percentile: Top 64%
Software Testing and Debugging Techniques
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.