Graph Prototype
A small proof-of-concept for evaluating efficient directed graph-based algorithms, notably required node structures, scheduling interfaces, and partial compile-time merging of directed acyclic as well as cyclic graphs (aka. feedback loops).
The expressed goal is to guide the low-level API design and functionality for the upcoming GNU Radio 4.0 release.
A single header version
is provided in the singleheader/subdirectory of the single-header branch.
If you want to locally regenerate the single header file, just follow
the CI step.
It can be used on compiler-explorer with -sdt=c++20 -O3 compiler options.
Copyright & License
Copyright (C) 2018-2022 FAIR -- Facility for Antiproton & Ion Research, Darmstadt, Germany
Unless otherwise noted: SPDX-License-Identifier: LGPL-3.0-or-later
Contributors
- Ivan Čukić ivan.cukic@kdab.com
- Matthias Kretz M.Kretz@GSI.de
- Alexander Krimm, A.Krimm@GSI.de
- Ralph J. Steinhagen, R.Steinhagen@GSI.de
Acknowledgements
...