https://github.com/neemiasbsilva/advanced-topics-computer-science
Advanced topics in computer science i.e. disjoint set, Kruskal's algorithm, binary indexed tree, and so forth.
https://github.com/neemiasbsilva/advanced-topics-computer-science
Last synced: 8 months ago
JSON representation
Advanced topics in computer science i.e. disjoint set, Kruskal's algorithm, binary indexed tree, and so forth.
- Host: GitHub
- URL: https://github.com/neemiasbsilva/advanced-topics-computer-science
- Owner: neemiasbsilva
- License: mit
- Created: 2020-08-18T14:27:37.000Z (about 5 years ago)
- Default Branch: master
- Last Pushed: 2020-12-01T22:43:26.000Z (almost 5 years ago)
- Last Synced: 2025-01-05T13:13:41.253Z (9 months ago)
- Language: Python
- Homepage:
- Size: 54.7 KB
- Stars: 0
- Watchers: 2
- Forks: 0
- Open Issues: 0
-
Metadata Files:
- Readme: readme.md
- License: LICENSE
Awesome Lists containing this project
README
# Advanced Topics in Computer Science
## Table of Contents
- [About](##about)
- [Concepts Used](#concepts)
- [Fenwick Tree (Binary Indexed Tree - BIT)](#union_find)
- [Kruskal's Algorithms](#kruska's)
- [Dynamic program](#dynamic-program)
- [License](##license)
- [References](##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](https://en.wikipedia.org/wiki/Disjoint-set_data_structure).
> -- [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](https://www.researchgate.net/publication/333672845_Route_Planning_using_The_Kruskal%27s_Algorithm_A_Case_of_Lobels_Bulawayo). For more details about the algorithm, please, [click here](https://en.wikipedia.org/wiki/Kruskal%27s_algorithm).
### Fenwick Tree (Binary Indexed Tree - BIT)
The Fenwick Tree (also kno as Binary Indexed Tree ([BIT](https://en.wikipedia.org/wiki/Fenwick_tree))) is a useful data sctuture for implemeting **dynamic comulative frequency tables**.
## License
[](http://badges.mit-license.org)
- **[MIT license](http://opensource.org/licenses/mit-license.php)**
## References
[1]:Galler, Bernard A., and Michael J. Fischer. "Disjoint-set data structure."
Sincerely: Neemias B. da Silva
#