Added report and updated README

3ximus · Jul 19, 2017 · 0b7a3eb · 0b7a3eb
1 parent 2744936
commit 0b7a3eb
Show file tree

Hide file tree

Showing 7 changed files with 8 additions and 3 deletions.
diff --git a/old_stuff/SplayTree/ST.c → ExtraOldVersions/SplayTree/ST.c b/old_stuff/SplayTree/ST.c → ExtraOldVersions/SplayTree/ST.c
diff --git a/old_stuff/SplayTree/ST.h → ExtraOldVersions/SplayTree/ST.h b/old_stuff/SplayTree/ST.h → ExtraOldVersions/SplayTree/ST.h
diff --git a/old_stuff/SplayTree/ST_test.c → ExtraOldVersions/SplayTree/ST_test.c b/old_stuff/SplayTree/ST_test.c → ExtraOldVersions/SplayTree/ST_test.c
diff --git a/old_stuff/full_debug_link_cut_tree.c → ExtraOldVersions/full_debug_link_cut_tree.c b/old_stuff/full_debug_link_cut_tree.c → ExtraOldVersions/full_debug_link_cut_tree.c
diff --git a/old_stuff/link-cut-tree_with_time_log.c → ...OldVersions/link-cut-tree_with_time_log.c b/old_stuff/link-cut-tree_with_time_log.c → ...OldVersions/link-cut-tree_with_time_log.c
diff --git a/README.md b/README.md
@@ -1,4 +1,9 @@
-# link-cut
-Connectivity in Forests
+# Link cut trees
+Implementation of link cut trees to represent a forest of rooted, unorderes trees.<br>
 
-Algorithms Project
+It supports the folloeing operations:
+ - `link(v, w)` - Adds an edge linking node v to node w. If such an edge already exists or this insertion would create a cycle then the operation has no effect.
+ - `cut(v, w)` - Removes the edge linking the node v to the node w, if such an edge exists. If the edge does not exist this operation has no effect.
+ - `connected(v, w)` - Returns true if there is a connection from v to w. If such a connection does not exist it returns false. A connection may consist of a single edge, or a sequence of edges, provided that it links v to w.
+
+Splay trees were used and, as the theoretical analysis predicted, we obtained a log(N) bound on all three operations. Experimental results can be seen in the report.
diff --git a/report.pdf b/report.pdf