Add required data structures for DecrementalTC::init

algorithm/decremental_tc.h

@@ -23,31 +23,38 @@ public:
 
   void remove(const T& u, const T& v);
 private:
-  // Every vertex u has a pointer C(u) to the component containing it
+  Digraph<T> G;
-  std::map<T, T> vc;
 
-  // For every component C, the algorithm maintains three linked lists
+  // Every vertex u has a pointer C(u) to the component containing it
-  // Ein(C), Eout(C), and Eint(C) of the incoming, outgoing, and the internal
+  std::map<T, SCC<T>> C;
-  // edges of the component C
+
-  std::forward_list<T> Ein;
+  // The aggregation of edges each component contains
-  std::forward_list<T> Eout;
+  struct LLE {
-  std::forward_list<T> Eint;
+    std::forward_list<T> Ein;
+    std::forward_list<T> Eout;
+    std::forward_list<T> Eint;
+  };
+
+  std::map<SCC<T>, LLE> E;
+
+  // Connect each component with a tree of all reachable components
+  std::map<SCC<T>, std::set<SCC<T>>> TC;
 };
 
 
 template<typename T>
-inline void DecrementalTC<T>::init() {
+void DecrementalTC<T>::init() {
 
 }
 
 template<typename T>
-inline bool DecrementalTC<T>::query(const T& u, const T& v) {
+bool DecrementalTC<T>::query(const T& u, const T& v) {
 
   return false;
 }
 
 template<typename T>
-inline void DecrementalTC<T>::remove(const T& u, const T& v) {
+void DecrementalTC<T>::remove(const T& u, const T& v) {
 
 }