63 lines
1.1 KiB
C++
63 lines
1.1 KiB
C++
#ifndef DECREMENTAL_TC_H_
|
|
#define DECREMENTAL_TC_H_
|
|
|
|
#include "algorithm/roditty_zwick.h"
|
|
#include "algorithm/tarjan.h"
|
|
#include "algorithm/breadth_first_search.h"
|
|
#include "tree/breadth_first_tree.h"
|
|
|
|
#include <forward_list>
|
|
|
|
using namespace graph;
|
|
|
|
namespace algo {
|
|
|
|
template<typename T>
|
|
class DecrementalTC : public RodittyZwick<T> {
|
|
public:
|
|
DecrementalTC(Digraph<T> G) : G(G) {}
|
|
|
|
void init();
|
|
|
|
bool query(const T& u, const T& v);
|
|
|
|
void remove(const T& u, const T& v);
|
|
private:
|
|
Digraph<T> G;
|
|
|
|
// Every vertex u has a pointer C(u) to the component containing it
|
|
std::map<T, SCC<T>> C;
|
|
|
|
// The aggregation of edges each component contains
|
|
struct LLE {
|
|
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>
|
|
void DecrementalTC<T>::init() {
|
|
|
|
}
|
|
|
|
template<typename T>
|
|
bool DecrementalTC<T>::query(const T& u, const T& v) {
|
|
|
|
return false;
|
|
}
|
|
|
|
template<typename T>
|
|
void DecrementalTC<T>::remove(const T& u, const T& v) {
|
|
|
|
}
|
|
|
|
} // namespace algo
|
|
|
|
#endif |