Advanced Data Structures and Algorithms

This repository includes my solutions for the course Advanced Data Structure and Algorithms (CFC11F) for Graduate School at The University of Aizu. Topics covered in the course include:

Set, disjoint set, union-find trees
Range query, segment trees, range minimum query, lazy evaluation, minimum spanning tree
Balanced tree, treap
Advanced graph algorithm, articulation points, and bridges
Heuristic Search: Iterative deepening A, A star

Name		Name	Last commit message	Last commit date
Latest commit History 7 Commits
.vscode		.vscode
puzzle15		puzzle15
.gitignore		.gitignore
readme.md		readme.md
w1_cycle_detection.py		w1_cycle_detection.py
w1_intersection.py		w1_intersection.py
w1_reconstruction_tree.py		w1_reconstruction_tree.py
w2_disjoint_set.py		w2_disjoint_set.py
w2_mst.py		w2_mst.py
w2_union_find_tree.py		w2_union_find_tree.py
w3_RMQ_RUQ.py		w3_RMQ_RUQ.py
w3_RUQ.py		w3_RUQ.py
w3_range_minimum_query.py		w3_range_minimum_query.py
w3_range_update_query.py		w3_range_update_query.py
w4_treap.cpp		w4_treap.cpp
w5_articulartion_point.cpp		w5_articulartion_point.cpp
w5_bridges.cpp		w5_bridges.cpp

Provide feedback