Advanced Topics in Computer Science
Table of Contents
- About
- Concepts Used
- Fenwick Tree (Binary Indexed Tree - BIT)
- Kruskal's Algorithms
- Dynamic program
- License
- References
About
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).
Concepts
Union-Find (Disjoint Set)
Union-Find is type of data structure that stores a set of elements partioned into a number of disjoint subsets asdasd.
-- [Galler][1].
Kruskal's
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.
Fenwick Tree (Binary Indexed Tree - BIT)
The Fenwick Tree (also kno as Binary Indexed Tree (BIT)) is a useful data sctuture for implemeting dynamic comulative frequency tables.
License
References
[1]:Galler, Bernard A., and Michael J. Fischer. "Disjoint-set data structure."
Sincerely: Neemias B. da Silva