CinderPeak Contribution Ideas Phase II: Adjacency Storage

[SharonIV0x86]

I’m excited to announce that CinderPeak is steadily approaching a stable release. At this stage, only a few core components remain before we can fully implement the Algorithms Module, which is a key part of any graph library.

Before diving into algorithms, a few foundational tasks need to be completed. If you’d like to contribute, you can pick any of the tasks below and open an issue with your proposed implementation plan.

Vertex Management in Adjacency Storage

• impl_removeVertex(const VertexType &v): Remove a vertex and all its incident edges.
• impl_hasVertex(const VertexType &v): Check if a vertex exists (shortcut for find != end).
• impl_numVertices(): Return the total number of vertices.
• impl_clearVertices(): Reset or clear all vertices.

Edge Management in Adjacency Storage

Edge Management

• impl_removeEdge(const VertexType &src, const VertexType &dest): Delete a specific edge.
• impl_updateEdge(const VertexType &src, const VertexType &dest, const EdgeType &newWeight): Update an edge’s weight without recreating it.
• impl_numEdges(): Return the total number of edges.
• impl_clearEdges(): Remove all edges while keeping the vertices intact.

Note: Please make sure to include tests with your implementation. And all the functions mentioned above must be implemented in the AdjacencyList.hpp. Kindly open one issue per function, grouping them together will make it difficult to track changes.

Regards
Anirudh Lakhanpal