Initial commit

c++/Others/DisjSets.h - Header file for disjoint sets algorithms.cpp

@@ -0,0 +1,37 @@
+DisjSets.h - Header file for disjoint sets algorithms
+
+#ifndef DISJ_SETS_H
+#define DISJ_SETS_H
+
+// DisjSets class
+//
+// CONSTRUCTION: with int representing initial number of sets
+//
+// ******************PUBLIC OPERATIONS*********************
+// void union( root1, root2 ) --> Merge two sets
+// int find( x )              --> Return set containing x
+// ******************ERRORS********************************
+// No error checking is performed
+
+#include <vector>
+using namespace std;
+
+/**
+ * Disjoint set class.
+ * Use union by rank and path compression.
+ * Elements in the set are numbered starting at 0.
+ */
+class DisjSets
+{
+  public:
+    explicit DisjSets( int numElements );
+
+    int find( int x ) const;
+    int find( int x );
+    void unionSets( int root1, int root2 );
+
+  private:
+    vector<int> s;
+};
+
+#endif