Class: Data Structure

cs_maze

Maze

Disjoint sets was used to generate and solve the maze problem. Solving the problem using for loops would take enormous time, however, disjoint sets can keep it in a minimum time.

 

Other Data Structures learnt: Heap memory, Hoffman, AVL Tree、BTree、Graph、Disjoint Sets

Advertisements

Leave a Reply

Fill in your details below or click an icon to log in:

WordPress.com Logo

You are commenting using your WordPress.com account. Log Out /  Change )

Google+ photo

You are commenting using your Google+ account. Log Out /  Change )

Twitter picture

You are commenting using your Twitter account. Log Out /  Change )

Facebook photo

You are commenting using your Facebook account. Log Out /  Change )

Connecting to %s