- About
- Concepts Used
- Fenwick Tree (Binary Indexed Tree - BIT)
- Kruskal's Algorithms
- Dynamic program
- License
- References
This repository was created to save tasks of the subject Topic in Computer Science. The concepts are advanced data structure (i.e. Union Find), programming paradigm, and graphs algorithm (i.e. Kruskal's algorithm).
Union-Find is type of data structure that stores a set of elements partioned into a number of disjoint subsets asdasd.
-- [Galler][1].
A Kruskal's algorithm find Minimum Spanning Tree (MST) in a undirected graph. It's use for many problems, for example, route planning. For more details about the algorithm, please, click here.
The Fenwick Tree (also kno as Binary Indexed Tree (BIT)) is a useful data sctuture for implemeting dynamic comulative frequency tables.
[1]:Galler, Bernard A., and Michael J. Fischer. "Disjoint-set data structure."
Sincerely: Neemias B. da Silva