stefiosif/reachability-algorithms
1
0
Fork 0
Code Issues Pull Requests Actions Packages Projects Releases Wiki Activity

Refactor: Rename adjMatrix to adjList

Browse Source
This commit is contained in:
stefiosif
2022-10-12 16:57:48 +03:00
parent 8b6d341d18
commit c525aeaa43
14 changed files with 56 additions and 56 deletions
Download Patch File Download Diff File Expand all files Collapse all files

8
algorithm/italiano.h
View File

@@ -47,7 +47,7 @@ private:
template<typename T>
void Italiano<T>::init() {
for (const auto& u : this->G.vertices()) {
for (const auto& v : this->G.adjMatrix[u]) {
for (const auto& v : this->G.adjList[u]) {
E[v].inc.insert(u);
E[u].out.insert(v);
TC[u][v] = false;
@@ -66,7 +66,7 @@ bool Italiano<T>::query(const T& u, const T& v) {
template<typename T>
void Italiano<T>::remove(const T& u, const T& v) {
if (!this->G.adjMatrix[u].contains(v)) return;
if (!this->G.adjList[u].contains(v)) return;
std::map<T, std::stack<T>> H;
for (const auto& w : this->G.vertices()) {
@@ -78,7 +78,7 @@ void Italiano<T>::remove(const T& u, const T& v) {
for (const auto& c : E[v].out)
H[w].push(c);
}
RT[w].adjMatrix[u].erase(v);
RT[w].adjList[u].erase(v);
}
}
E[u].out.erase(v);
@@ -97,7 +97,7 @@ void Italiano<T>::repairTrees(std::map<T, std::stack<T>>& H) {
for (const auto& i : E[h].inc) {
if (RT[z].contains(z, i)) {
RT[z].adjMatrix[i].insert(h);
RT[z].adjList[i].insert(h);
found = true;
break;
}