v1.0.1

• Added the final keyword to the following classes:
  • {vertex/edge}_descriptor
  • adjacency_{list/matrix}
  • graph
• Marked the destructors of the property classes and the iterator_range class as virtual (if they are explicitly configured not to be final)

v1.0.0

Initial library release

Overview:

• Concept-based template header-only graph library for C++20 and newer standards
• Highly customizable and extensive core graph class which allows for the representation of directed and undirected graphs with vertex and edge properties using an adjacency list or an adjacency matrix implementation
• Compatibility with C++ standard library tools, e.g.: range-based loops, std algorithms, the ranges library, stream operations, etc.
• Predefined property types, topology generators and graph algorithms
• CMake integration
• No exteranal dependencies in the implementation
• MIT licence

v1.0-prerelease-1

v1.0 prerelease - iteration: 1

NOTES: Added the project's documentation / user guide and made small cleanup changes in the code

v1.0-prerelease-0

v1.0 prerelease - iteration: 0

NOTES: The implementation of all planned features is complete, however the documentation and demos are yet to be added