Pré-Publication, Document De Travail Année : 2024

CARDS: A collection of package, revision, and miscellaneous dependency graphs

Résumé

CARDS (Corpus of Acyclic Repositories and Dependency Systems) is a collection of directed graphs which express dependency relations, extracted from diverse real-world sources such as package managers, version control systems, and event graphs. Each graph contains anywhere from thousands to hundreds of millions of nodes and edges, which are normalized into a simple, unified format. Both cyclic and acyclic variants are included (as some graphs, such as citation networks, are not entirely acyclic). The dataset is suitable for studying the structure of different kinds of dependencies, enabling the characterization and distinction of various dependency graph types. It has been utilized for developing and testing efficient algorithms which leverage the specificities of source version control graphs. The collection is publicly available at doi.org/10.5281/zenodo.14245890.

Fichier principal
Vignette du fichier
main.pdf (123.4 Ko) Télécharger le fichier
Origine Fichiers produits par l'(les) auteur(s)
Licence
DOI

Cite 10.5281/zenodo.14245890 Jeu de données TRAN-GIRARD, E., BULTEAU, L., & DAVID, P.-Y. (2024). CARDS: A collection of package, revision, and miscellaneous dependency graphs [Data set]. Zenodo. https://doi.org/10.5281/ZENODO.14245890

Dates et versions

hal-04929691 , version 1 (04-02-2025)

Licence

Identifiants

  • HAL Id : hal-04929691 , version 1

Citer

Euxane Tran-Girard, Laurent Bulteau, Pierre-Yves David. CARDS: A collection of package, revision, and miscellaneous dependency graphs. 2024. ⟨hal-04929691⟩
428 Consultations
329 Téléchargements

Partager

  • More