This command will copy the basic template with headers and macros famously used in competitive programming. Sections may be added/removed in the future on the basis of use in competitive programming.
Same as basic but with test cases
Currently only one snippet available for segment tree which provide snippet for building, updating and querying segment tree with lazy propogation.
Disjoint Set Unions:
This command will import code for basic disjoint set unions (also known as union-finds) with rank and parent vectors included.
Depth First Search- Basic:
This command will import code for basic depth first search in graph.
Breadth First Search- Basic:
This command will import code for basic Breadth first search in graph.
This command will import code for basic code for Krushkal Algorithm which calculates minimum cost spanning tree for a graph in $O(Elog(E))$.
This is solo project and no requirements are there so far.
No Issue reported so far
Initial release with segment tree and basic macros
Added snippet of Disjoint Set Union
Added snippet of Basic Breadth First Search, Depth First Search and Krushkal Algorithm
Fixed Problem with Disjoint Set Union snippet